IDEAS home Printed from https://ideas.repec.org/a/spr/stpapr/v66y2025i4d10.1007_s00362-025-01706-w.html
   My bibliography  Save this article

Online convex optimization for survival analysis: an adaptive and stochastic approach

Author

Listed:
  • Camila Fernandez

    (Sorbonne University
    Inria Grenoble)

  • Pierre Gaillard

    (Inria Grenoble)

  • Joseph de Vilmarest

    (Viking Conseil)

  • Olivier Wintenberger

    (Sorbonne University)

Abstract

We introduce an online mathematical framework for survival analysis, allowing real time adaptation to dynamic environments and censored data. This framework enables the estimation of event time distributions through an optimal second order online convex optimization algorithm-Online Newton Step (ONS). This approach, previously unexplored, presents substantial advantages, including explicit algorithms with non-asymptotic convergence guarantees. Moreover, we analyze the selection of ONS hyperparameters, which depends on the exp-concavity property and has a significant influence on the regret bound. We introduce an adaptive aggregation method that ensures robustness in hyperparameter selection while maintaining fast regret bounds. These findings can extend beyond the survival analysis field, and are relevant for any case characterized by poor exp-concavity and unstable ONS. Additionally, we propose a stochastic approach for ONS that guarantees logarithmic regret in the case of an exponential hazard model. Next, these assertions are illustrated by simulation experiments, followed by an application to a real dataset.

Suggested Citation

  • Camila Fernandez & Pierre Gaillard & Joseph de Vilmarest & Olivier Wintenberger, 2025. "Online convex optimization for survival analysis: an adaptive and stochastic approach," Statistical Papers, Springer, vol. 66(4), pages 1-44, June.
    • Handle: RePEc:spr:stpapr:v:66:y:2025:i:4:d:10.1007_s00362-025-01706-w
    DOI: 10.1007/s00362-025-01706-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00362-025-01706-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00362-025-01706-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:stpapr:v:66:y:2025:i:4:d:10.1007_s00362-025-01706-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.