SDPM: Survival Diffusion Probabilistic Model for Continuous-Time Survival Analysis
AuthorsStanislav R. Kirpichenko, Andrei V. Konstantinov, Lev V. Utkin
Resources
This paper uses diffusion models to generate survival times and censoring outcomes, aiming to make continuous-time survival analysis more flexible and accurate without discretizing time.
Key results
SDPM was evaluated on 10 real-world survival datasets, including FLC, Ovarian, PBC, SEER, SUPPORT, TCGA-GBM, VLBW, and WHAS500.
SDPM won integrated Brier score on FLC, PBC, Rotterdam, SEER, SUPPORT, TCGA-GBM, and VLBW.
In the ablation study, the full SDPM reduced average event-rate calibration error to 5.0 percentage points versus 6.7 percentage points for the ablated variant.
What the paper found
SDPM, or Survival Diffusion Probabilistic Model, reframes continuous-time survival analysis as conditional generation of the observed outcome pair (T, δ) rather than direct hazard or discretized time prediction. The model uses a DDPM-style reverse diffusion process over a two-dimensional target space built from standardized log-times and a Gaussian-mixture encoding of the censoring indicator, then reconstructs the conditional survival curve with the Kaplan–Meier estimator under independent censoring. This design removes fixed time-bin discretization and yields a controllable trade-off: using more generated samples improves Kaplan–Meier stability and calibration, while moderate changes in reverse diffusion steps leave performance relatively robust. On 10 real-world datasets, including FLC, Ovarian, PBC, SEER, SUPPORT, TCGA-GBM, VLBW, and WHAS500, SDPM was compared with Random Survival Forest, DeepSurv, DeepHit, XGBSEKaplanNeighbors, and XGBSEStackedWeibull. It achieved the best average rank overall and was especially strong on integrated Brier score, winning 7 of 10 datasets; it also matched or led on discrimination, taking the top C-index on FLC, PBC, SEER, and TCGA-GBM and the top time-dependent AUC on five datasets. An ablation showed that the target-space transformations matter: they eliminated negative-time samples, reduced event-rate calibration error from 6.7 to 5.0 percentage points, and improved C-index on 8 of 10 datasets. Synthetic Cox-Weibull experiments further showed that with 2,000 generated samples, SDPM recovered the analytical survival curve better than Random Survival Forest, confirming that diffusion-based outcome generation can approximate continuous survival structure more faithfully than standard nonparametric baselines.
Original abstract
Survival analysis aims to estimate a time-to-event distribution from data with censored observations. Many existing methods either impose structural assumptions on the hazard function or discretize the time axis, which may limit flexibility and introduce approximation errors. We propose the Survival Diffusion Probabilistic Model (SDPM), a generative approach to continuous-time survival analysis. SDPM models the conditional distribution of the survival outcome, represented by the pair of observed time and censoring indicator, $\mathbb{P}(T,δ\mid \mathbf{x})$, using a denoising diffusion model. Under the assumption of conditionally independent censoring, conditional samples generated by the model can be transformed into survival function estimates using the Kaplan-Meier estimator. This formulation avoids parametric assumptions on the event-time distribution and does not require a discretization of the output time space. The model operates in a transformed target space, using standardized log-times and a continuous Gaussian-mixture representation of the censoring indicator. We evaluate SDPM on ten real survival datasets and compare it with five strong baselines, including tree-based, boosting-based, and neural survival models. Results show that SDPM achieves competitive predictive performance across C-index, integrated time-dependent AUC, and integrated Brier score. A study on synthetic Cox-Weibull data demonstrates that SDPM can recover the shape of an underlying continuous survival distribution more accurately than a strong nonparametric baseline when sufficiently many samples are generated. An ablation study confirms the importance of the proposed target-space transformations, which improve event-rate calibration, reduce invalid generated times, and provide consistent gains in predictive discrimination. Codes implementing the proposed model are publicly available.
Read the original paperMore in Generative Models
Browse all 63 papers →RULER: Instance-aware Rubric Rewards for SVG Generation
Hangyu Ran, Yuhao Zheng, Yingying Zhang, Kevin Qinghong Lin, Han Peng
RULER uses instruction-specific visual rubrics as reinforcement-learning rewards to make SVG generation more faithful, stylish, and resistant to reward hacking.
Think Before You Score: Thinking Reward Model for Visual Generation
Xuehai Bai, Zhenchen Tang, Yang Shi, Dianyi Wang, Tengfei Liu, Wanshun Su, Xuanyu Zhu, Ruohui Wang, Haiwen Diao, Haotian Wang, Xiaoling Gu, Yuanxing Zhang
A visual reward model that first decides what matters in each image-generation case, then scores outputs with detailed rubrics to provide better training signals.
WanPE: Towards Cinematic Prompt Enhancement for Modern Text-to-Video Generation
Yubo Zhu, Yawen Shao, Ziyun Dai, Zixun Fang, Kai Zhu, Siyang Sun, Haolan Xue, Chuxin Wang, Tingyu Weng, Jingming Luo, Chen Shi, Lianghua Huang, Yufeng Ai, Yuzheng Wang, Wenyuan Zhang, Yu Shang, Yuxiang Bao, Zoubin Bi, Jie Xiao, Jinbo Xing, Jiaxing Zhao, Chongyang Zhong, Hengjian Chen, Chenwei Xie, Akide Liu, Zhehan Kan, Yu Liu, Wei Zhai, Sheng Zhong, Wei Tong
WanPE turns ordinary text prompts into director-level cinematic plans, substantially improving the quality and consistency of long-form AI-generated videos.