Partial Identification of Survival Prediction Performance under Dependent Right Censoring

Yuji Komiyama; Yasumasa Matsuda

Home/Archive/arXiv

arXiv · 2610.32488

Partial Identification of Survival Prediction Performance under Dependent Right Censoring

Yuji Komiyama·Yasumasa Matsuda

View original source ↗Read source document ↗Export metadata ↓

Abstract

Survival prediction models are usually evaluated under right censoring by inverse probability of censoring weighting (IPCW), which assumes independent censoring, an assumption that cannot generally be verified from right-censored data. Leaving the dependence between event and censoring times unrestricted, we derive sharp bounds on the integrated Brier score (IBS) of a fixed model and on IBS differences between models by partial identification. The bounds use the fact that each individual's event time is shared across evaluation times and models, and for more than two models we also derive the sharp upper bound on the difference from the best competitor. A negative upper bound on a difference shows that one model has a smaller IBS than the other under every full-data distribution compatible with the observed data. For a fixed observed-data distribution, we develop estimators, confidence regions, a test of robust strict dominance, and an intersection-union test. In simulations, the confidence regions and pairwise tests performed close to their nominal levels. In three applications, the tests supported the IPCW ranking only for mortgage prepayment data with little censoring, whereas for the other two data sets the observed data alone did not support it.

Explore related subjects

stat.ME

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Yuji Komiyama, Yasumasa Matsuda. 2026-10-23. Partial Identification of Survival Prediction Performance under Dependent Right Censoring. https://arxiv.org/abs/2610.32488

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Selection from Hierarchical Data with Conformal e-values

Distribution-free predictive inference beyond the construction of prediction sets has gained a lot of interest in recent applications. One such application is the selection task, where the objective is to design a reliable selection rule to pick out individuals with desired unobserved outcomes while controlling the error rate. In this work, we address the selection problem in the context of hierarchical data, where groups of observations may exhibit distinct within-group distributions. This generalizes existing techniques beyond the standard i.i.d./exchangeable data settings. As a correction, For hierarchical data, we introduce methods to construct valid conformal e-values, enabling control of the false discovery rate (FDR) through the e-BH procedure. In particular, we introduce and compare two approaches -- subsampling conformal e-values and hierarchical conformal e-values. Empirical results demonstrate that both approaches achieve valid FDR control while highlighting a tradeoff between stability and power. The subsampling-based method, though random, typically offers higher power, whereas the hierarchical approach, being deterministic, tends to be slightly less powerful. The effectiveness of the proposed methods is illustrated in two real-world applications.

stat.ME↗

arXiv2026

Conformalized Polynomial Chaos Expansion for Uncertainty-aware Surrogate Modeling

This work introduces a method to equip data-driven polynomial chaos expansion surrogate models with intervals that quantify the predictive uncertainty of the surrogate. To that end, jackknife-based conformal prediction is integrated into regression-based polynomial chaos expansions. The jackknife algorithm uses leave-one-out residuals to generate predictive intervals around the predictions of the polynomial chaos surrogate. The jackknife+ extension additionally requires leave-one-out model predictions. Both methods allow to use the entire dataset for model training and do not require a hold-out dataset for prediction interval calibration. The key to efficient implementation is to leverage the linearity of the polynomial chaos regression model, so that leave-one-out residuals and, if necessary, leave-one-out model predictions can be computed with analytical, closed-form expressions. This eliminates the need for repeated model re-training. The conformalized polynomial chaos expansion method is first validated on four benchmark models and then applied to two electrical engineering design use-cases. The method produces predictive intervals that provide the target coverages, even for low-accuracy models trained with small datasets. At the same time, training data availability plays a crucial role in improving the empirical coverage and narrowing the predictive interval, as well as in reducing their variability over different training datasets.

stat.ME↗

arXiv2026

High-dimensional reliability-oriented Shapley effects estimation

This article presents a new estimation scheme for the reliability-oriented Shapley effects when there is a large number of correlated input variables, using a unique sample of failure points. First, we propose a new reformulation of the reliability-oriented closed Sobol indices. This reformulation circumvents the estimation issues associated with existing methods in the literature, but requires estimating densities in potentially high dimensions. Once the reliability-oriented closed Sobol indices have been estimated through these densities, the reliability-oriented Shapley effects are estimated through permutation aggregation to circumvent the issue related to the dimension. In addition, we provide an error estimation procedure relying on the same sample of failing points resulting in a probabilistic error bound, and avoiding any additional call to the model. We illustrate our methodology on numerical use-cases where we compare several density estimators and we propose an application to the monitoring of adaptive importance sampling.

stat.ME↗