Ensemble linear interpolators: The role of ensembling
Not on the map. Why?
Abstract (arXiv)
Interpolators are unstable. For example, the mininum ℓ2 norm least square interpolator exhibits unbounded test errors when dealing with noisy data. In this paper, we study how ensemble stabilizes and thus improves the generalization performance, measured by the out-of-sample prediction risk, of an individual interpolator. We focus on bagged linear interpolators, as bagging is a popular randomization-based ensemble method that can be implemented in parallel. We introduce the multiplier-bootstrap-based bagged least square estimator, which can then be formulated as an average of the sketched least square estimators. The proposed multiplier bootstrap encompasses the classical bootstrap with replacement as a special case, along with a more intriguing variant which we call the Bernoulli bootstrap. Focusing on the proportional regime where the sample size scales proportionally with the feature dimensionality, we investigate the out-of-sample prediction risks of the sketched and bagged least square estimators in both underparametrized and overparameterized regimes. Our results reveal the statistical roles of sketching and bagging. In particular, sketching modifies the aspect ratio and shifts the interpolation threshold of the minimum ℓ2 norm estimator. However, the risk of the sketched estimator continues to be unbounded around the interpolation threshold due to excessive variance. In stark contrast, bagging effectively mitigates this variance, leading to a bounded limiting out-of-sample prediction risk. To further understand this stability improvement property, we establish that bagging acts as a form of implicit regularization, substantiated by the equivalence of the bagged estimator with its explicitly regularized counterpart. We also discuss several extensions.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 42 references that are in the map. First posted on arXiv 6 Sep 2023.
Builds on
21 of 42 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2014Deep Learning in Neural Networks: An Overviewcited by 765
- 2019Benign Overfitting in Linear Regressioncited by 544
- 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
- 2019On instabilities of deep learning in image reconstruction - Does AI come at a cost?cited by 211
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
- 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 146
- 2015Why M Heads are Better than One: Training a Diverse Ensemble of Deep Networkscited by 138
9 more
- 2016An Analysis of Deep Neural Network Models for Practical Applicationscited by 114
- 2020Precise Tradeoffs in Adversarial Training for Linear Regressioncited by 76
- 2020Asymptotics of Ridge (less) Regression under General Source Conditioncited by 61
- 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
- 2019Randomization as Regularization: A Degrees of Freedom Explanation for Random Forest Successcited by 30
- 2019The Implicit Regularization of Ordinary Least Squares Ensemblescited by 25
- 2023An Overview on Language Models: Recent Developments and Outlookcited by 22
- 2014A Statistical Perspective on Randomized Sketching for Ordinary Least-Squarescited by 21
- 2023Sketched Ridgeless Linear Regression: The Role of Downsamplingcited by 7
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.