Optimal Sparse Survival Trees
Rui Zhang, Rui Xin, Margo Seltzer, Cynthia Rudin
TL;DR
This work tackles time-to-event prediction with censoring by delivering OSST, a provably optimal sparse survival tree method. It introduces a dynamic-programming-with-bounds framework that optimizes a regularized Integrated Brier Score objective $R(t,\mathbf{X},\mathbf{c},\mathbf{y})=\mathcal{L}(t,\mathbf{X},\mathbf{c},\mathbf{y})+\lambda H_t$ while pruning the search with hierarchical bounds, Equivalent Points, and a reference-model guessing bound. Experiments on 17 datasets show OSST achieves superior IBS ratios, good generalization (via cross-validation), and stronger overall quality (C-index and AUC) compared with interpretable baselines, while producing substantially sparser trees. The results demonstrate practical, scalable, and interpretable survival modeling suitable for high-stakes domains, with public code available for reproducibility and extension.
Abstract
Interpretability is crucial for doctors, hospitals, pharmaceutical companies and biotechnology corporations to analyze and make decisions for high stakes problems that involve human health. Tree-based methods have been widely adopted for survival analysis due to their appealing interpretablility and their ability to capture complex relationships. However, most existing methods to produce survival trees rely on heuristic (or greedy) algorithms, which risk producing sub-optimal models. We present a dynamic-programming-with-bounds approach that finds provably-optimal sparse survival tree models, frequently in only a few seconds.
