On the Variance, Admissibility, and Stability of Empirical Risk Minimization
Not on the map. Why?
Abstract (arXiv)
It is well known that Empirical Risk Minimization (ERM) may attain minimax suboptimal rates in terms of the mean squared error (Birg'e and Massart, 1993). In this paper, we prove that, under relatively mild assumptions, the suboptimality of ERM must be due to its large bias. Namely, the variance error term of ERM is bounded by the minimax rate. In the fixed design setting, we provide an elementary proof of this result using the probabilistic method. Then, we extend our proof to the random design setting for various models. In addition, we provide a simple proof of Chatterjee's admissibility theorem (Chatterjee, 2014, Theorem 1.4), which states that in the fixed design setting, ERM cannot be ruled out as an optimal method, and then we extend this result to the random design setting. We also show that our estimates imply the stability of ERM, complementing the main result of Caponnetto and Rakhlin (2006) for non-Donsker classes. Finally, we highlight the somewhat irregular nature of the loss landscape of ERM in the non-Donsker regime, by showing that functions can be close to ERM, in terms of L2 distance, while still being far from almost-minimizers of the empirical loss.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 16 of its 60 references that are in the map. First posted on arXiv 29 May 2023.
Builds on
16 of 60 references.
References · 16
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2021A Universal Law of Robustness via Isoperimetrycited by 151
- 2018Does data interpolation contradict statistical optimality?cited by 95
- 2018A modern maximum-likelihood theory for high-dimensional logistic regressioncited by 81
- 2014Learning without Concentrationcited by 50
- 2018The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regressioncited by 46
- 2015De-biasing the Lasso: Optimal Sample Size for Gaussian Designscited by 35
- 2013Empirical entropy, minimax regret and minimax riskcited by 21
- 2019Optimality of Maximum Likelihood for Log-Concave Density Estimation and Bounded Convex Regressioncited by 10
- 2019Fitting Tractable Convex Sets to Support Function Evaluationscited by 7
4 more
- 2020Convex Regression in Multidimensions: Suboptimality of Least Squares Estimatorscited by 7
- 2020On Suboptimality of Least Squares with Application to Estimation of Convex Bodiescited by 7
- 2018Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densitiescited by 3
- 2021On the Minimal Error of Empirical Risk Minimizationcited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2026Model Agreement via Anchoring26 Feb 2026
- 2026Risk reversal for least squares estimators under nested convex constraints22 Jan 2026
- 2025Addressing Label Shift in Distributed Learning via Entropy Regularization4 Feb 2025