SearcharxivSearch

arXiv · 2503.10823

Surviving the frailty of time to event analysis in massive datasets with Generalized Additive Models (and the help of Simon Laplace)

Abstract

Analyses of time to event datasets have been invariably based on the Cox proportional hazards model (PHM). Reformulations of the PHM as a Poisson Generalized Additive Model (GAM) or as a Generalized Linear Mixed Model (GLMM) have been proposed in the literature, aiming to increase the flexibility of the PHM and allow its use in situations in which complex spatiotemporal relationships have to be taken into account when modeling survival. In this report, we provide a unified framework for considering these previous attempts and consider the implementation in software for GAM and GLMM in the R programming language. The connection between GAM/GLMM and the PHM is leveraged to provide computationally efficient implementations for a subclass of survival models that incorporate individual random effects ('frailty models'). Frailty models provide a unified method to address repeated events, correlated outcomes and also time varying visitation schedules when analyzing Electronic Health Record data. However the current implementation of frailty models in software facilities for the Cox model does not scale because of long computation times; conversely the direct implementation of individual random effects in GAM/GLMM software does not scale well with memory usage. We propose a two stage method for survival models with frailty based on the Laplace approximation. Using a D-optimal experimental design to simulate the performance of the proposed method across simulated datasets we illustrate that the proposed method can circumvent the limitations of existing implementations, opening up the possibility to model datasets of hundred of thousands to million individuals using high end workstations from within R.

Explore related subjects

Keep this discovery

BibTeXRIS

Christos Argyropoulos, Hamza Mir, Maria-Eleni Roumelioti, Pablo Garcia. 2025-03-13. Surviving the frailty of time to event analysis in massive datasets with Generalized Additive Models (and the help of Simon Laplace). https://arxiv.org/abs/2503.10823

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

KEEP EXPLORING

Related papers

Surprise Reduction and Nullification in Bayesian and Inverse Bayesian Inference under Ambiguous Prediction-Error Attribution

In non-stationary environments, prediction errors may signal environmental change or transient outliers, and adaptive systems must track such changes without overreacting to outliers. We distinguish surprise reduction, which updates beliefs to fit observations, from surprise nullification, which weakens constraints imposed by the predictive structure, and formalize both within Bayesian and inverse Bayesian (BIB) inference. Belief and likelihood updates are derived from variational objectives sharing a nullification strength, determined endogenously by minimizing surprise under the candidate post-update predictive distribution. In the Gaussian case, nullification expands belief and likelihood variances by a common factor relative to standard Bayesian updating, leaving the ratio unchanged. BIB thus defers attribution of the prediction error, committing to neither latent-state change nor observation-process uncertainty. The nullification strength is carried over as a candidate and is maintained or released according to the predictive surprise of the next observation. In a mean estimation task with outliers and changepoints, no scanned parameter setting of a Sage-Husa-type adaptive Kalman filter, fixed-strength BIB variant, or belief-forgetting-only variant outperforms BIB in both changepoint tracking and post-outlier stability. An oracle-informed reduced Bayesian model tracks changepoints better but is less stable after outliers. Although BIB maintains no explicit hypotheses about changepoints or outliers, it generates event-dependent dynamics. The learning rate increases after changepoints, whereas after outliers, nullification is released, and this increase is suppressed. Deferring attribution and letting subsequent observations differentiate the responses may constitute a principle of adaptive inference in non-stationary environments.

stat.ME

Generalized Ridge Refitting for the Lasso and Prediction Improvement Bounds

We study a class of Lasso based estimators obtained by applying a quadratic correction on the Lasso equicorrelation set. The penalty matrix determines both the magnitude and geometry of the correction and contains, among other cases, the isotropic Lasso--Ridge correction, least squares refitting, Gram proportional interpolation between the Lasso and least squares, and coordinate specific penalties. We first derive a closed form representation and isolate the positive gain component of the resulting prediction improvement. We then control the remaining stochastic linear term in expectation by localizing the random signed equicorrelation model around a deterministic reference support. This yields a finite sample expectation bound that explicitly accounts for the randomness induced by Lasso model selection. The resulting decomposition provides a unified framework for understanding when Lasso based quadratic corrections can improve prediction.

stat.ME

Discretization in covariate-adaptive randomization: gains and losses

Covariate-adaptive randomization(CAR) is widely implemented in clinical trials to balance prognostic covariates across treatment arms. Continuous covariates are often discretized into strata in practice, yet their consequences are not clearly understood. This paper provides a comprehensive study of the impact of discretization on both the CAR design process and the inferential results thereafter. We establish the asymptotic properties of both imbalance measures and treatment effect estimators under discretized and non-discretized settings. Practical recommendations are given on when and how discretization should be employed. We show that discretization in design is generally recommended, as it enhances robustness against model misspecification. However, if the true model is known, the most efficient strategy is to balance covariates according to that model in the design. The theoretical results are corroborated by extensive simulation studies and an empirical application to a diabetes trial dataset. Together, the results clarify the gains and losses of discretization in CAR and pave the way for learning impact of discretization to other designs and beyond.

stat.ME