Mitigating multiple descents: A model-agnostic framework for risk monotonization
Not on the map. Why?
Abstract (arXiv)
Recent empirical and theoretical analyses of several commonly used prediction procedures reveal a peculiar risk behavior in high dimensions, referred to as double/multiple descent, in which the asymptotic risk is a non-monotonic function of the limiting aspect ratio of the number of features or parameters to the sample size. To mitigate this undesirable behavior, we develop a general framework for risk monotonization based on cross-validation that takes as input a generic prediction procedure and returns a modified procedure whose out-of-sample prediction risk is, asymptotically, monotonic in the limiting aspect ratio. As part of our framework, we propose two data-driven methodologies, namely zero- and one-step, that are akin to bagging and boosting, respectively, and show that, under very mild assumptions, they provably achieve monotonic asymptotic risk behavior. Our results are applicable to a broad variety of prediction procedures and loss functions, and do not require a well-specified (parametric) model. We exemplify our framework with concrete analyses of the minimum ℓ2, ℓ1-norm least squares prediction procedures. As one of the ingredients in our analysis, we also derive novel additive and multiplicative forms of oracle risk inequalities for split cross-validation that are of independent interest.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 26 of its 112 references that are in the map. First posted on arXiv 25 May 2022.
Builds on
26 of 112 references.
References · 26
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
- 2021Deep learning: a statistical viewpointcited by 239
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2019Mean estimation and regression under heavy-tailed distributions--a surveycited by 133
- 2020Optimal Regularization Can Mitigate Double Descentcited by 107
- 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
- 2018The jamming transition as a paradigm to understand the loss landscape of deep neural networkscited by 61
- 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learningcited by 54
- 2020A Precise High-Dimensional Asymptotic Theory for Boosting and Minimum-ℓ1-Norm Interpolated Classifierscited by 44
14 more
- 2020Multiple Descent: Design Your Own Generalization Curvecited by 44
- 2020The Lasso with general Gaussian designs with applications to hypothesis testingcited by 40
- 2013A framework to characterize performance of LASSO algorithmscited by 38
- 2019More Data Can Hurt for Linear Regression: Sample-wise Double Descentcited by 37
- 2020Analytic Study of Double Descent in Binary Classification: The Impact of Losscited by 28
- 2019The generalization error of max-margin linear classifiers: Benign overfitting and high dimensional asymptotics in the overparametrized regimecited by 27
- 2019Understanding overfitting peaks in generalization error: Analytical risk curves for l2 and l1 penalized interpolationcited by 23
- 2018Distributed linear regression by averagingcited by 21
- 2019Ridge Regression: Structure, Cross-Validation, and Sketchingcited by 15
- 2018Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problemscited by 6
- 2021Data splitting improves statistical performance in overparametrized regimescited by 6
- 2021Minimum ℓ1-norm interpolators: Precise asymptotics and multiple descentcited by 5
- 2018Statistical Optimality of Interpolated Nearest Neighbor Algorithmscited by 3
- 2022Benefit of Interpolation in Nearest Neighbor Algorithmscited by 1
Built on by
Citing papers per year: 2022: 2; 2023: 4; 2024: 3.
9 papers.
- 2022The good, the bad and the ugly sides of data augmentation: An implicit spectral regularization perspectivecited by 24
- 2024Optimal Ridge Regularization for Out-of-Distribution Predictioncited by 18
- 2023Subsample Ridge Ensembles: Equivalences and Generalized Cross-Validationcited by 11
- 2022Multiple Descent in the Multiple Random Feature Modelcited by 10
- 2023Generalized equivalences between subsampling and ridge regularizationcited by 10
- 2023Extrapolated cross-validation for randomized ensemblescited by 4
- 2024Revisiting Optimism and Model Complexity in the Wake of Overparameterized Machine Learningcited by 2
- 2024Implicit Regularization Paths of Weighted Neural Representationscited by 1
- 2023Understanding the Role of Optimization in Double Descentcited by 0
- 2024Revisiting Optimism and Model Complexity in the Wake of Overparameterized Machine Learning2 Oct 2024
- 2024Implicit Regularization Paths of Weighted Neural Representations28 Aug 2024
- 2024Optimal Ridge Regularization for Out-of-Distribution Prediction1 Apr 2024
- 2023Understanding the Role of Optimization in Double Descent6 Dec 2023
- 2023Generalized equivalences between subsampling and ridge regularization29 May 2023
- 2023Subsample Ridge Ensembles: Equivalences and Generalized Cross-Validation25 Apr 2023
- 2023Extrapolated cross-validation for randomized ensembles27 Feb 2023
- 2022The good, the bad and the ugly sides of data augmentation: An implicit spectral regularization perspective10 Oct 2022
- 2022Multiple Descent in the Multiple Random Feature Model21 Aug 2022