mlsanityData to 7 Oct 2026

ROTI-GCV: Generalized Cross-Validation for right-ROTationally Invariant Data

arXiv 2406.11666 ↗First posted 17 Jun 2024math.ST cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

Two key tasks in high-dimensional regularized regression are tuning the regularization strength for accurate predictions and estimating the out-of-sample risk. It is known that the standard approach -- k-fold cross-validation -- is inconsistent in modern high-dimensional settings. While leave-one-out and generalized cross-validation remain consistent in some high-dimensional cases, they become inconsistent when samples are dependent or contain heavy-tailed covariates. As a first step towards modeling structured sample dependence and heavy tails, we use right-rotationally invariant covariate distributions -- a crucial concept from compressed sensing. In the proportional asymptotics regime where the number of features and samples grow comparably, which is known to better reflect the empirical behavior in moderately sized datasets, we introduce a new framework, ROTI-GCV, for reliably performing cross-validation under these challenging conditions. Along the way, we propose new estimators for the signal-to-noise ratio and noise variance. We conduct experiments that demonstrate the accuracy of our approach in a variety of synthetic and semi-synthetic settings.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 24 of its 85 references that are in the map. First posted on arXiv 17 Jun 2024.

Builds on

24 of 85 references.

References · 24

  1. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  2. 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 146
  3. 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 97
  4. 2018A modern maximum-likelihood theory for high-dimensional logistic regressioncited by 79
  5. 2013Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Ratescited by 64
  6. 2018Products of Many Large Random Matrices and Gradients in Deep Neural Networkscited by 49
  7. 2024Scaling and renormalization in high-dimensional regressioncited by 45
  8. 2020A Precise High-Dimensional Asymptotic Theory for Boosting and Minimum-ℓ1-Norm Interpolated Classifierscited by 44
  9. 2020Approximate Message Passing algorithms for rotationally invariant matricescited by 31
  10. 2019On Robustness of Principal Component Regressioncited by 27
  11. 2020Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (or : How to Prove Kabashima's Replica Formula)cited by 23
  12. 2021Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passingcited by 18
12 more
  1. 2017The Likelihood Ratio Test in High-Dimensional Logistic Regression Is Asymptotically a Rescaled Chi-Squarecited by 15
  2. 2019Consistent Risk Estimation in Moderately High-Dimensional Linear Regressioncited by 14
  3. 2018A scalable estimate of the extra-sample prediction error via approximate leave-one-outcited by 10
  4. 2016Distributed Generalized Cross-Validation for Divide-and-Conquer Kernel Ridge Regression and its Asymptotic Optimalitycited by 9
  5. 2020Memory AMPcited by 9
  6. 2018Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problemscited by 6
  7. 2014Projected principal component analysis in factor modelscited by 5
  8. 2024High-dimensional analysis of ridge regression for non-identically distributed data with a variance profilecited by 4
  9. 2020Canonical thresholding for non-sparse high-dimensional linear regressioncited by 3
  10. 2022Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Modelscited by 3
  11. 2019Large-dimensional Factor Analysis without Moment Constraintscited by 1
  12. 2022Envelopes and principal component regressioncited by 1

Built on by

Cited by year

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

4 papers.