Suboptimality of Constrained Least Squares and Improvements via Non-Linear Predictors
Not on the map. Why?
Abstract (arXiv)
We study the problem of predicting as well as the best linear predictor in a bounded Euclidean ball with respect to the squared loss. When only boundedness of the data generating distribution is assumed, we establish that the least squares estimator constrained to a bounded Euclidean ball does not attain the classical O(d/n) excess risk rate, where d is the dimension of the covariates and n is the number of samples. In particular, we construct a bounded distribution such that the constrained least squares estimator incurs an excess risk of order Omega(d3/2/n) hence refuting a recent conjecture of Ohad Shamir [JMLR 2015]. In contrast, we observe that non-linear predictors can achieve the optimal rate O(d/n) with no assumptions on the distribution of the covariates. We discuss additional distributional assumptions sufficient to guarantee an O(d/n) excess risk rate for the least squares estimator. Among them are certain moment equivalence assumptions often used in the robust statistics literature. While such assumptions are central in the analysis of unbounded and heavy-tailed settings, our work indicates that in some cases, they also rule out unfavorable bounded distributions.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 3; 2024: 0; 2025: 1.
9 papers.
- 2021Stability and Deviation Optimal Risk Bounds with Convergence Rate O(1/n)cited by 42
- 2021Distribution-Free Robust Linear Regressioncited by 19
- 2022An elementary analysis of ridge regression with random designcited by 15
- 2022Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Conditioncited by 9
- 2023High-Probability Risk Bounds via Sequential Predictorscited by 9
- 2023Exploring Local Norms in Exp-concave Statistical Learningcited by 2
- 2023Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear Regressioncited by 2
- 2025PAC Learning is just Bipartite Matching (Sort of)cited by 1
- 2021Improved Learning Rates for Stochastic Optimizationcited by 0
- 2025PAC Learning is just Bipartite Matching (Sort of)2 Feb 2025
- 2023Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear Regression19 Oct 2023
- 2023High-Probability Risk Bounds via Sequential Predictors15 Aug 2023
- 2023Exploring Local Norms in Exp-concave Statistical Learning21 Feb 2023
- 2022An elementary analysis of ridge regression with random design16 Mar 2022
- 2022Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition23 Feb 2022
- 2021Improved Learning Rates for Stochastic Optimization19 Jul 2021
- 2021Stability and Deviation Optimal Risk Bounds with Convergence Rate O(1/n)22 Mar 2021
- 2021Distribution-Free Robust Linear Regression25 Feb 2021