arXiv Machine Learning

Value-Monotonicity Matters: A Concordance Loss for Deep Survival Prediction

arXiv:2607. 16802v1 Announce Type: new Abstract: Deep survival models are evaluated almost exclusively by the concordance index (C-index), yet they are commonly trained using likelihood objectives such as the Cox partial likelihood, discrete-time negative log-likelihood, and DeepHit likelihood.

arXiv Machine Learning
Jun 4

SurvPFN: Towards Foundation Models for Survival Predictions

arXiv:2606. 04564v1 Announce Type: new Abstract: Tabular foundation models (TFMs) have made rapid progress in standard classification and regression, but time-to-event survival prediction tasks have remained largely untouched.

By Samuel B\"ohm (Institute of Epidemiology and Prevention, Medical Center - University of Freiburg, Faculty of Medicine, University of Freiburg, Freiburg, Germany), Lennart Purucker (Department of Computer Science, University of Freiburg, Freiburg, Germany, PriorLabs, Freiburg, Germany), Frank Hutter (Department of Computer Science, University of Freiburg, Freiburg, Germany, PriorLabs, Freiburg, Germany), Pascal Schlosser (Institute of Epidemiology and Prevention, Medical Center - University of Freiburg, Faculty of Medicine, University of Freiburg, Freiburg, Germany, Department of Epidemiology, Johns Hopkins Bloomberg School of Public Health, Baltimore, Maryland, US, CIBSS - Centre for Integrative Biological Signalling Studies, University of Freiburg, Freiburg, Germany)
arXiv Machine Learning
Jul 21

Tabular Foundation Models Can Do Survival Analysis

arXiv:2601. 22259v2 Announce Type: replace Abstract: While tabular foundation models have achieved remarkable success in classification and regression, adapting them to model time-to-event outcomes for survival analysis is non-trivial due to right-censoring, where data observations may end before the event of interest occurs.

By Da In Kim, Wei Siang Lai, Kelly W. Zhang
Hugging Face Trending Papers
Aug 4

Predicting Deep Neural Network Training Outcomes from Early Training Telemetry

Large hyperparameter sweeps for deep neural networks spend substantial compute on configurations that are effectively doomed from the first few epochs. We study whether a single training run's own early telemetry - per-epoch loss, training accuracy, gradient signal-to-noise ratio, weight-norm growth, and an activation-saturation snapshot - together with its sampled hyperparameters, can predict that run's eventual outcome without reference to other runs.