mlsanityData to 7 Oct 2026

Corrected generalized cross-validation for finite ensembles of penalized estimators

arXiv 2310.01374 ↗First posted 2 Oct 2023math.ST stat.ME stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

Generalized cross-validation (GCV) is a widely-used method for estimating the squared out-of-sample prediction risk that employs a scalar degrees of freedom adjustment (in a multiplicative sense) to the squared training error. In this paper, we examine the consistency of GCV for estimating the prediction risk of arbitrary ensembles of penalized least-squares estimators. We show that GCV is inconsistent for any finite ensemble of size greater than one. Towards repairing this shortcoming, we identify a correction that involves an additional scalar correction (in an additive sense) based on degrees of freedom adjusted training errors from each ensemble component. The proposed estimator (termed CGCV) maintains the computational advantages of GCV and requires neither sample splitting, model refitting, or out-of-bag risk estimation. The estimator stems from a finer inspection of the ensemble risk decomposition and two intermediate risk estimators for the components in this decomposition. We provide a non-asymptotic analysis of the CGCV and the two intermediate risk estimators for ensembles of convex penalized estimators under Gaussian features and a linear response model. Furthermore, in the special case of ridge regression, we extend the analysis to general feature and response distributions using random matrix theory, which establishes model-free uniform consistency of CGCV.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 21 of its 74 references that are in the map. First posted on arXiv 2 Oct 2023.

Builds on

21 of 74 references.

References · 21

  1. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  2. 2021Deep learning: a statistical viewpointcited by 239
  3. 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 146
  4. 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
  5. 2022More Than a Toy: Random Matrix Models Predict How Real-World Neural Representations Generalizecited by 87
  6. 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 75
  7. 2020The Lasso with general Gaussian designs with applications to hypothesis testingcited by 40
  8. 2019The Implicit Regularization of Ordinary Least Squares Ensemblescited by 25
  9. 2019Consistent Risk Estimation in Moderately High-Dimensional Linear Regressioncited by 14
  10. 2020Out-of-sample error estimate for robust M-estimators with convex penaltycited by 13
  11. 2022Bagging in overparameterized learning: Risk characterization and risk monotonizationcited by 11
  12. 2023Subsample Ridge Ensembles: Equivalences and Generalized Cross-Validationcited by 11
9 more
  1. 2019Estimating the Algorithmic Variance of Randomized Ensembles via the Bootstrapcited by 10
  2. 2023Generalized equivalences between subsampling and ridge regularizationcited by 10
  3. 2021Derivatives and residual distribution of regularized M-estimators with application to adaptive tuningcited by 7
  4. 2021Data splitting improves statistical performance in overparametrized regimescited by 6
  5. 2019Measuring the Algorithmic Convergence of Randomized Ensembles: The Regression Settingcited by 5
  6. 2023Extrapolated cross-validation for randomized ensemblescited by 4
  7. 2022Noise Covariance Estimation in Multi-Task High-dimensional Linear Modelscited by 3
  8. 2023Multinomial Logistic Regression: Asymptotic Normality on Null Covariates in High-Dimensionscited by 3
  9. 2021Chi-square and normal inference in high-dimensional multi-task regressioncited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 2; 2025: 2.

5 papers.