Optimal Survival Trees: A Dynamic Programming Approach

• URL: http://arxiv.org/abs/2401.04489v1
• Date: Tue, 9 Jan 2024 11:01:11 GMT
• Title: Optimal Survival Trees: A Dynamic Programming Approach
• Authors: Tim Huisman, Jacobus G. M. van der Linden, Emir Demirovi\'c
• Abstract summary: Survival analysis studies and predicts the time of death, or other singular unrepeated events, based on historical data. We use dynamic programming to provide the first survival tree method with optimality guarantees.
• Score: 8.815461200424776
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Survival analysis studies and predicts the time of death, or other singular unrepeated events, based on historical data, while the true time of death for some instances is unknown. Survival trees enable the discovery of complex nonlinear relations in a compact human comprehensible model, by recursively splitting the population and predicting a distinct survival distribution in each leaf node. We use dynamic programming to provide the first survival tree method with optimality guarantees, enabling the assessment of the optimality gap of heuristics. We improve the scalability of our method through a special algorithm for computing trees up to depth two. The experiments show that our method's run time even outperforms some heuristics for realistic cases while obtaining similar out-of-sample performance with the state-of-the-art.

Related papers

• Survival Models: Proper Scoring Rule and Stochastic Optimization with Competing Risks [6.9648613217501705]
  SurvivalBoost outperforms 12 state-of-the-art models on 4 real-life datasets. It provides great calibration, the ability to predict across any time horizon, and computation times faster than existing methods.
  arXiv  Detail & Related papers  (2024-10-22T07:33:34Z)
• Deep End-to-End Survival Analysis with Temporal Consistency [49.77103348208835]
  We present a novel Survival Analysis algorithm designed to efficiently handle large-scale longitudinal data. A central idea in our method is temporal consistency, a hypothesis that past and future outcomes in the data evolve smoothly over time. Our framework uniquely incorporates temporal consistency into large datasets by providing a stable training signal.
  arXiv  Detail & Related papers  (2024-10-09T11:37:09Z)
• Variational Deep Survival Machines: Survival Regression with Censored Outcomes [11.82370259688716]
  Survival regression aims to predict the time when an event of interest will take place, typically a death or a failure. We present a novel method to predict the survival time by better clustering the survival data and combine primitive distributions.
  arXiv  Detail & Related papers  (2024-04-24T02:16:00Z)
• Optimal Sparse Survival Trees [23.23106906682907]
  Tree-based methods have been widely adopted for survival analysis due to their appealing interpretablility and their ability to capture complex relationships. We present a dynamic-programming-with-bounds approach that finds provably-optimal sparse survival tree models.
  arXiv  Detail & Related papers  (2024-01-27T07:26:10Z)
• NSOTree: Neural Survival Oblique Tree [0.21756081703275998]
  Survival analysis is a statistical method employed to scrutinize the duration until a specific event of interest transpires. Deep learning-based methods have dominated this field due to their representational capacity and state-of-the-art performance. In this paper, we leverage the strengths of both neural networks and tree-based methods, capitalizing on their ability to approximate intricate functions while maintaining interpretability.
  arXiv  Detail & Related papers  (2023-09-25T02:14:15Z)
• SurvivalGAN: Generating Time-to-Event Data for Survival Analysis [121.84429525403694]
  Imbalances in censoring and time horizons cause generative models to experience three new failure modes specific to survival analysis. We propose SurvivalGAN, a generative model that handles survival data by addressing the imbalance in the censoring and event horizons. We evaluate this method via extensive experiments on medical datasets.
  arXiv  Detail & Related papers  (2023-02-24T17:03:51Z)
• Social Interpretable Tree for Pedestrian Trajectory Prediction [75.81745697967608]
  We propose a tree-based method, termed as Social Interpretable Tree (SIT), to address this multi-modal prediction task. A path in the tree from the root to leaf represents an individual possible future trajectory. Despite the hand-crafted tree, the experimental results on ETH-UCY and Stanford Drone datasets demonstrate that our method is capable of matching or exceeding the performance of state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-26T12:18:44Z)
• Masked prediction tasks: a parameter identifiability view [49.533046139235466]
  We focus on the widely used self-supervised learning method of predicting masked tokens. We show that there is a rich landscape of possibilities, out of which some prediction tasks yield identifiability, while others do not.
  arXiv  Detail & Related papers  (2022-02-18T17:09:32Z)
• Optimal Survival Trees [2.7910505923792637]
  We present a new Optimal Survival Trees algorithm that leverages mixed-integer optimization (MIO) and local search techniques to generate globally optimized survival tree models. We demonstrate that the algorithm improves on the accuracy of existing survival tree methods, particularly in large datasets.
  arXiv  Detail & Related papers  (2020-12-08T09:00:57Z)
• MurTree: Optimal Classification Trees via Dynamic Programming and Search [61.817059565926336]
  We present a novel algorithm for learning optimal classification trees based on dynamic programming and search. Our approach uses only a fraction of the time required by the state-of-the-art and can handle datasets with tens of thousands of instances.
  arXiv  Detail & Related papers  (2020-07-24T17:06:55Z)
• Generalized and Scalable Optimal Sparse Decision Trees [56.35541305670828]
  We present techniques that produce optimal decision trees over a variety of objectives. We also introduce a scalable algorithm that produces provably optimal results in the presence of continuous variables.
  arXiv  Detail & Related papers  (2020-06-15T19:00:11Z)

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.