mlsanityData to 7 Oct 2026

Can we globally optimize cross-validation loss? Quasiconvexity in ridge regression

arXiv 2107.09194 ↗First posted 19 Jul 2021stat.ML cs.LG stat.MEcited by 8

Not on the map. Why?

Abstract (arXiv)

Models like LASSO and ridge regression are extensively used in practice due to their interpretability, ease of use, and strong theoretical guarantees. Cross-validation (CV) is widely used for hyperparameter tuning in these models, but do practical optimization methods minimize the true out-of-sample loss? A recent line of research promises to show that the optimum of the CV loss matches the optimum of the out-of-sample loss (possibly after simple corrections). It remains to show how tractable it is to minimize the CV loss. In the present paper, we show that, in the case of ridge regression, the CV loss may fail to be quasiconvex and thus may have multiple local optima. We can guarantee that the CV loss is quasiconvex in at least one case: when the spectrum of the covariate matrix is nearly flat and the noise in the observed responses is not too high. More generally, we show that quasiconvexity status is independent of many properties of the observed data (response norm, covariate-matrix right singular vectors and singular-value scaling) and has a complex dependence on the few that remain. We empirically confirm our theory using simulated experiments.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 11 of its 41 references that are in the map. First posted on arXiv 19 Jul 2021.

Builds on

11 of 41 references.

References · 11

  1. 2021Convex optimizationcited by 2,479
  2. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  3. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
  4. 2019Optimizing Millions of Hyperparameters by Implicit Differentiationcited by 303
  5. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
  6. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 289
  7. 2014Sketching as a Tool for Numerical Linear Algebracited by 285
  8. 2016Deep Learning without Poor Local Minimacited by 233
  9. 2016Hyperparameter optimization with approximate gradientcited by 231
  10. 2020Approximate Cross-validation: Guarantees for Model Assessment and Selectioncited by 14
  11. 2018A scalable estimate of the extra-sample prediction error via approximate leave-one-outcited by 10

Built on by

Cited by year

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

8 papers.