Beyond Cox Models: Assessing the Performance of Machine-Learning Methods in Non-Proportional Hazards and Non-Linear Survival Analysis

• URL: http://arxiv.org/abs/2504.17568v1
• Date: Thu, 24 Apr 2025 13:58:07 GMT
• Title: Beyond Cox Models: Assessing the Performance of Machine-Learning Methods in Non-Proportional Hazards and Non-Linear Survival Analysis
• Authors: Ivan Rossi, Flavio Sartori, Cesare Rollo, Giovanni Birolo, Piero Fariselli, Tiziana Sanavia,
• Abstract summary: Survival analysis often relies on Cox models, assuming both linearity and proportional hazards (PH)<n>This study evaluates machine and deep learning methods that relax these constraints.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Survival analysis often relies on Cox models, assuming both linearity and proportional hazards (PH). This study evaluates machine and deep learning methods that relax these constraints, comparing their performance with penalized Cox models on a benchmark of three synthetic and three real datasets. In total, eight different models were tested, including six non-linear models of which four were also non-PH. Although Cox regression often yielded satisfactory performance, we showed the conditions under which machine and deep learning models can perform better. Indeed, the performance of these methods has often been underestimated due to the improper use of Harrell's concordance index (C-index) instead of more appropriate scores such as Antolini's concordance index, which generalizes C-index in cases where the PH assumption does not hold. In addition, since occasionally high C-index models happen to be badly calibrated, combining Antolini's C-index with Brier's score is useful to assess the overall performance of a survival method. Results on our benchmark data showed that survival prediction should be approached by testing different methods to select the most appropriate one according to sample size, non-linearity and non-PH conditions. To allow an easy reproducibility of these tests on our benchmark data, code and documentation are freely available at https://github.com/compbiomed-unito/survhive.

Related papers

• Modeling of AUV Dynamics with Limited Resources: Efficient Online Learning Using Uncertainty [9.176056742068814]
  This work investigates the use of uncertainty in the selection of data points to rehearse in online learning when storage capacity is constrained.<n>We present three novel approaches: the Threshold method, which excludes samples with uncertainty below a specified threshold, the Greedy method, designed to maximize uncertainty among the stored points, and Threshold-Greedy, which combines the previous two approaches.
  arXiv  Detail & Related papers  (2025-04-06T18:48:55Z)
• A Large-Scale Neutral Comparison Study of Survival Models on Low-Dimensional Data [7.199059106376138]
  This work presents the first large-scale neutral benchmark experiment focused on single-event, right-censored, low-dimensional survival data. We benchmark 18 models, ranging from classical statistical approaches to many common machine learning methods, on 32 publicly available datasets.
  arXiv  Detail & Related papers  (2024-06-06T14:13:38Z)
• Getting More Juice Out of Your Data: Hard Pair Refinement Enhances Visual-Language Models Without Extra Data [122.282521548393]
  Contrastive Language-Image Pre-training (CLIP) has become the standard for cross-modal image-text representation learning.<n>We introduce HELIP, a cost-effective strategy that improves CLIP models by exploiting challenging text-image pairs within existing datasets in continuous training.
  arXiv  Detail & Related papers  (2023-05-09T07:00:17Z)
• Boosting Differentiable Causal Discovery via Adaptive Sample Reweighting [62.23057729112182]
  Differentiable score-based causal discovery methods learn a directed acyclic graph from observational data. We propose a model-agnostic framework to boost causal discovery performance by dynamically learning the adaptive weights for the Reweighted Score function, ReScore.
  arXiv  Detail & Related papers  (2023-03-06T14:49:59Z)
• A Statistical Learning Take on the Concordance Index for Survival Analysis [0.29005223064604074]
  We provide C-index Fisher-consistency results and excess risk bounds for several commonly used cost functions in survival analysis. We also study the general case where no model assumption is made and present a new, off-the-shelf method that is shown to be consistent with the C-index.
  arXiv  Detail & Related papers  (2023-02-23T14:33:54Z)
• Towards Robust Recommender Systems via Triple Cooperative Defense [63.64651805384898]
  Recommender systems are often susceptible to well-crafted fake profiles, leading to biased recommendations. We propose a general framework, Triple Cooperative Defense, which cooperates to improve model robustness through the co-training of three models. Results show that the robustness improvement of TCD significantly outperforms baselines.
  arXiv  Detail & Related papers  (2022-10-25T04:45:43Z)
• Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendation [59.500347564280204]
  We propose a new Aleatoric Uncertainty-aware Recommendation (AUR) framework. AUR consists of a new uncertainty estimator along with a normal recommender model. As the chance of mislabeling reflects the potential of a pair, AUR makes recommendations according to the uncertainty.
  arXiv  Detail & Related papers  (2022-09-22T04:32:51Z)
• 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)
• Testing the Robustness of Learned Index Structures [15.472214703318805]
  This work evaluates the robustness of learned index structures in the presence of adversarial workloads. To simulate adversarial workloads, we carry out a data poisoning attack on linear regression models. We show that learned index structures can suffer from a significant performance deterioration of up to 20% when evaluated on poisoned vs. non-poisoned datasets.
  arXiv  Detail & Related papers  (2022-07-23T18:44:54Z)
• Good Classifiers are Abundant in the Interpolating Regime [64.72044662855612]
  We develop a methodology to compute precisely the full distribution of test errors among interpolating classifiers. We find that test errors tend to concentrate around a small typical value $varepsilon*$, which deviates substantially from the test error of worst-case interpolating model. Our results show that the usual style of analysis in statistical learning theory may not be fine-grained enough to capture the good generalization performance observed in practice.
  arXiv  Detail & Related papers  (2020-06-22T21:12:31Z)
• Federated Survival Analysis with Discrete-Time Cox Models [0.46331617589391827]
  We build machine learning models from decentralized datasets located in different centers with federated learning (FL) We show that the resulting model may suffer from important performance loss in some adverse settings. Using this approach, we train survival models using standard FL techniques on synthetic data, as well as real-world datasets from The Cancer Genome Atlas (TCGA)
  arXiv  Detail & Related papers  (2020-06-16T08:53:19Z)
• Efficient Ensemble Model Generation for Uncertainty Estimation with Bayesian Approximation in Segmentation [74.06904875527556]
  We propose a generic and efficient segmentation framework to construct ensemble segmentation models. In the proposed method, ensemble models can be efficiently generated by using the layer selection method. We also devise a new pixel-wise uncertainty loss, which improves the predictive performance.
  arXiv  Detail & Related papers  (2020-05-21T16:08:38Z)

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.