Online Survival Analysis: A Bandit Approach under Cox PH Model

• URL: http://arxiv.org/abs/2604.20296v1
• Date: Wed, 22 Apr 2026 07:52:06 GMT
• Title: Online Survival Analysis: A Bandit Approach under Cox PH Model
• Abstract summary: We take an initial step toward integrating survival analysis into a purely online learning setting under the Cox PH model.<n>We adapt three canonical bandit algorithms to balance exploration and exploitation, with theoretical guarantees of sublinear regret bounds.<n>Our approach enables rapid and effective learning of near-optimal treatment policies.
• Score: 12.224664685642287
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Survival analysis is a widely used statistical framework for modeling time-to-event data under censoring. Classical methods, such as the Cox proportional hazards (Cox PH) model, offer a semiparametric approach to estimating the effects of covariates on the hazard function. Despite its importance, survival analysis has been largely unexplored in online settings, particularly within the bandit framework, where decisions must be made sequentially to optimize treatments as new data arrive over time. In this work, we take an initial step toward integrating survival analysis into a purely online learning setting under the Cox PH model, addressing key challenges including staggered entry, delayed feedback, and right censoring. We adapt three canonical bandit algorithms to balance exploration and exploitation, with theoretical guarantees of sublinear regret bounds. Extensive simulations and semi-real experiments using SEER cancer data demonstrate that our approach enables rapid and effective learning of near-optimal treatment policies.

Related papers

• Aligning Data-Driven Predictors with Allocation: A Decision-Focused Approach to Survival Analysis [52.10284705210197]
  We show that machine learning predictors can yield arbitrarily poor outcomes when used for allocation.<n>We introduce a decision-focused learning approach based on optimizing normalized discounted cumulative gain (NDCG)<n>We propose a bootstrapping approach to optimize the NDCG of existing survival models.
  arXiv  Detail & Related papers  (2026-06-01T12:03:22Z)
• Isotonic Survival Regression: Calibrated Survival Distributions from Deep Cox Models [10.543514030176768]
  Time-to-event data is widespread across the life sciences and engineering, but it is typically encountered together with censoring.<n>Deep Cox models have emerged as a popular method for analyzing time-to-event data because they gracefully handle censoring.<n>We propose a novel post hoc calibration method for Deep Cox models that uses isotonic regression to refine predicted survival probabilities.
  arXiv  Detail & Related papers  (2026-05-15T19:20:23Z)
• SurvKAN: A Fully Parametric Survival Model Based on Kolmogorov-Arnold Networks [7.352227733654751]
  We introduce SurvKAN, a fully parametric, time-continuous survival model based on Kolmogorov-Arnold Networks (KANs)<n>SurvKAN treats time as an explicit input to a KAN that directly predicts the log-hazard function, enabling end-to-end training on the full survival likelihood.
  arXiv  Detail & Related papers  (2026-02-02T14:49:14Z)
• TraCeR: Transformer-Based Competing Risk Analysis with Longitudinal Covariates [0.0]
  TraCeR is a transformer-based survival analysis framework.<n>It estimates the hazard function from a sequence of measurements.<n>Experiments on multiple real-world datasets demonstrate substantial and statistically significant performance improvements.
  arXiv  Detail & Related papers  (2025-12-19T23:24:47Z)
• Methodology for Comparing Machine Learning Algorithms for Survival Analysis [55.65997641180011]
  Six machine learning models for survival analysis were evaluated.<n>XGB-AFT achieved the best performance (C-Index = 0.7618; IPCW = 0.7532, followed by GBSA and RSF)
  arXiv  Detail & Related papers  (2025-10-28T14:42:28Z)
• Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update [70.38810219913593]
  We study the generalized linear bandit (GLB) problem, a contextual multi-armed bandit framework that extends the classical linear model by incorporating a non-linear link function.<n>GLBs are widely applicable to real-world scenarios, but their non-linear nature introduces significant challenges in achieving both computational and statistical efficiency.<n>We propose a jointly efficient algorithm that attains a nearly optimal regret bound with $mathcalO(1)$ time and space complexities per round.
  arXiv  Detail & Related papers  (2025-07-16T02:24:21Z)
• Distributionally Robust Learning in Survival Analysis [6.946903076677842]
  We introduce an innovative approach that incorporates a Distributionally Robust Learning (DRL) approach into Cox regression.<n>By formulating a DRL framework with a Wasserstein distance-based ambiguity set, we develop a variant Cox model that is less sensitive to assumptions about the underlying data distribution.<n>We demonstrate that our regression model achieves superior performance in terms of prediction accuracy and robustness compared with traditional methods.
  arXiv  Detail & Related papers  (2025-06-02T06:11:22Z)
• MIBP-Cert: Certified Training against Data Perturbations with Mixed-Integer Bilinear Programs [50.41998220099097]
  Data errors, corruptions, and poisoning attacks during training pose a major threat to the reliability of modern AI systems.<n>We introduce MIBP-Cert, a novel certification method based on mixed-integer bilinear programming (MIBP)<n>By computing the set of parameters reachable through perturbed or manipulated data, we can predict all possible outcomes and guarantee robustness.
  arXiv  Detail & Related papers  (2024-12-13T14:56:39Z)
• Interpretable Survival Analysis for Heart Failure Risk Prediction [50.64739292687567]
  We propose a novel survival analysis pipeline that is both interpretable and competitive with state-of-the-art survival models. Our pipeline achieves state-of-the-art performance and provides interesting and novel insights about risk factors for heart failure.
  arXiv  Detail & Related papers  (2023-10-24T02:56:05Z)
• FastCPH: Efficient Survival Analysis for Neural Networks [57.03275837523063]
  We propose FastCPH, a new method that runs in linear time and supports both the standard Breslow and Efron methods for tied events. We also demonstrate the performance of FastCPH combined with LassoNet, a neural network that provides interpretability through feature sparsity.
  arXiv  Detail & Related papers  (2022-08-21T03:35:29Z)
• DeepHazard: neural network for time-varying risks [0.6091702876917281]
  We propose a new flexible method for survival prediction: DeepHazard, a neural network for time-varying risks. Our approach is tailored for a wide range of continuous hazards forms, with the only restriction of being additive in time. Numerical examples illustrate that our approach outperforms existing state-of-the-art methodology in terms of predictive capability evaluated through the C-index metric.
  arXiv  Detail & Related papers  (2020-07-26T21:01:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.