Search arXiv⌕ Search

arXiv · 2610.41230

Source projection for calibrated transfer learning in survival prediction

Abstract

Transfer learning can improve survival prediction in cohorts with few events. An external model may capture useful covariate associations yet systematically overestimate or underestimate risk in the target population, creating a need for selective borrowing. We propose Source Projection Transfer (SPT) for fixed-horizon prediction with a target generalized additive model. SPT requires only source predictions at target covariates, supporting generalized additive, Cox and neural-network source models without individual-level source data. It projects source log-odds scores onto the target basis and borrows through two separately adapted channels: a projection-centered penalty transfers effect shapes, while intercept-recalibrated soft labels inform probabilities at the target risk level. Under local asymptotics, projection avoids the strictly positive risk cost of estimating an uninformative additional source direction. Each channel asymptotically switches off under its corresponding persistent-mismatch condition. In log-logistic and Weibull simulations with covariate shift, SPT improves mean Brier score and discrimination over target-only modeling in all 24 setting-distribution-horizon combinations. Matched comparisons show improvements over borrowing through source probabilities alone across settings, and over borrowing the complete source score under structural mismatch. In UK Biobank-to-SPRINT mortality prediction among standard-treatment participants with reduced kidney function, SPT improves mean discrimination at 24, 30 and 36 months, with Brier improvements at 24 and 36 months. SPT enables flexible source learners to inform a parsimonious target model while adapting to differences between populations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fangzhou Cao, Ting Tian. 2026-10-30. Source projection for calibrated transfer learning in survival prediction. https://arxiv.org/abs/2610.41230

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

KEEP EXPLORING

Related papers

Debiased Estimating Equation Method for Robust and Efficient Mendelian Randomization Using a Large Number of Correlated Weak and Invalid Instruments

Mendelian randomization (MR) is a widely used tool for causal inference in the presence of unmeasured confounders, which uses single nucleotide polymorphisms (SNPs) as instrumental variables to estimate causal effects. However, SNPs often have weak effects on complex traits, leading to bias in existing MR analyses when weak instruments are included. In addition, existing MR methods often restrict analysis to independent SNPs via linkage disequilibrium clumping and result in a loss of efficiency in estimating the causal effect due to discarding correlated SNPs. To address these issues, we propose the Debiased Estimating Equation Method (DEEM), a summary statistics-based MR approach that can incorporate a large number of correlated, weak-effect, and invalid SNPs. DEEM effectively eliminates the weak instrument bias and improves the statistical efficiency of the causal effect estimation by leveraging information from a large number of correlated SNPs. DEEM also allows for pleiotropic effects, adjusts for the winner's curse, and applies to both two-sample and one-sample MR analyses. Asymptotic analyses of the DEEM estimator demonstrate its attractive theoretical properties. Through extensive simulations and two real data examples, we demonstrate that DEEM significantly improves the efficiency and robustness of MR analysis compared with existing methods.

stat.ME↗

Latent Space Graph-fused LASSO for Clustering in Attributed Graphs

This manuscript studies latent space graph-fused LASSO methods for clustering graphs with multivariate nodal attributes. The framework includes node-specific priors of low-dimensional representations coupled with a neural decoder that bridges the observed attributes with the latent variables. Both structural and attribute information are incorporated for the clustering through a graph-fused LASSO regularization on prior nodal means. The optimization problem is solved via the alternating direction method of multipliers with Langevin dynamics for posterior inference. Simulations on grid and block graphs, together with applications to California county temperatures and Los Angeles traffic data, demonstrate the effectiveness of the proposed method.

stat.ME↗

Missing data and cluster graphs: cluster-level missingness vs variable-level missingness

Missing data is pervasive in many scientific domains such as public health, environmental science, and the social sciences. Recoverability from missing data is typically studied using fully specified variable-level missingness models despite that, in many applications, only coarse structural information is available, for instance when variables are grouped into clusters due to limited knowledge or interpretability reasons. In this paper, we investigate recoverability from such abstract representations. We introduce two classes of cluster-based missingness graphs: the m-C-DMG, which retains variable-specific missingness indicators, and the cm-C-DMG, which aggregates missingness mechanisms at the cluster level. We formalize the notion of compatibility between these abstract graphs and underlying variable-level missingness models, and study how this abstraction affects the recoverability of probabilistic and causal queries. In particular, we give graphical conditions of recovering the joint distribution as well as graphical conditions of recovering a macro causal effect.

stat.ME↗