The Sample Complexity of Learning Linear Predictors with the Squared Loss
Not on the map. Why?
Abstract (arXiv)
In this short note, we provide a sample complexity lower bound for learning linear predictors with respect to the squared loss. Our focus is on an agnostic setting, where no assumptions are made on the data distribution. This contrasts with standard results in the literature, which either make distributional assumptions, refer to specific parameter settings, or use other performance measures.
Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Jun 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 5; 2024: 2; 2025: 1; 2026: 4.
16 papers.
Sort:
- 2021Distribution-Free Robust Linear Regressioncited by 19
- 2022Differentially Private Generalized Linear Models Revisitedcited by 17
- 2023An Adaptive Algorithm for Learning with Unknown Distribution Driftcited by 16
- 2023High-Probability Risk Bounds via Sequential Predictorscited by 10
- 2022Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Conditioncited by 9
- 2024Omnipredicting Single-Index Models with Multi-Index Modelscited by 7
- 2023Local Risk Bounds for Statistical Aggregationcited by 3
- 2026Simultaneous Blackwell Approachability and Applications to Multiclass Omnipredictioncited by 3
- 2021Distribution Free Uncertainty for the Minimum Norm Solution of Over-parameterized Linear Regressioncited by 2
- 2023Exploring Local Norms in Exp-concave Statistical Learningcited by 2
- 2023A new Gradient TD Algorithm with only One Step-size: Convergence Rate Analysis using L-λ Smoothnesscited by 2
- 2024Sample Complexity of the Sign-Perturbed Sums Methodcited by 1
4 more
- 2026Near-Optimal Private Linear Regression via Iterative Hessian Mixingcited by 1
- 2025Hardness, Structural Knowledge, and Opportunity: An Analytical Framework for Modular Performance Modelingcited by 0
- 2026Modulated learning for private and distributed regression with just a single sample per client devicecited by 0
- 2026The Fast Mixing Mechanism for Differential Privacycited by 0
- 2026The Fast Mixing Mechanism for Differential Privacy28 May 2026
- 2026Modulated learning for private and distributed regression with just a single sample per client device8 May 2026
- 2026Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction19 Feb 2026
- 2026Near-Optimal Private Linear Regression via Iterative Hessian Mixing12 Jan 2026
- 2025Hardness, Structural Knowledge, and Opportunity: An Analytical Framework for Modular Performance Modeling13 Sep 2025
- 2024Omnipredicting Single-Index Models with Multi-Index Models20 Nov 2024
- 2024Sample Complexity of the Sign-Perturbed Sums Method2 Sep 2024
- 2023High-Probability Risk Bounds via Sequential Predictors15 Aug 2023
- 2023A new Gradient TD Algorithm with only One Step-size: Convergence Rate Analysis using L-λ Smoothness29 Jul 2023
- 2023Local Risk Bounds for Statistical Aggregation29 Jun 2023
- 2023An Adaptive Algorithm for Learning with Unknown Distribution Drift3 May 2023
- 2023Exploring Local Norms in Exp-concave Statistical Learning21 Feb 2023
4 more
- 2022Differentially Private Generalized Linear Models Revisited6 May 2022
- 2022Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition23 Feb 2022
- 2021Distribution-Free Robust Linear Regression25 Feb 2021
- 2021Distribution Free Uncertainty for the Minimum Norm Solution of Over-parameterized Linear Regression14 Feb 2021
- 2021Distribution-Free Robust Linear Regressioncited by 19
- 2022Differentially Private Generalized Linear Models Revisitedcited by 17
- 2023An Adaptive Algorithm for Learning with Unknown Distribution Driftcited by 16
- 2023High-Probability Risk Bounds via Sequential Predictorscited by 10
- 2022Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Conditioncited by 9
- 2024Omnipredicting Single-Index Models with Multi-Index Modelscited by 7
- 2023Local Risk Bounds for Statistical Aggregationcited by 3
- 2026Simultaneous Blackwell Approachability and Applications to Multiclass Omnipredictioncited by 3
- 2021Distribution Free Uncertainty for the Minimum Norm Solution of Over-parameterized Linear Regressioncited by 2
- 2023Exploring Local Norms in Exp-concave Statistical Learningcited by 2
- 2023A new Gradient TD Algorithm with only One Step-size: Convergence Rate Analysis using L-λ Smoothnesscited by 2
- 2024Sample Complexity of the Sign-Perturbed Sums Methodcited by 1
12 most cited of 16 All 16 (JSON)
- 2026The Fast Mixing Mechanism for Differential Privacy28 May 2026
- 2026Modulated learning for private and distributed regression with just a single sample per client device8 May 2026
- 2026Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction19 Feb 2026
- 2026Near-Optimal Private Linear Regression via Iterative Hessian Mixing12 Jan 2026
- 2025Hardness, Structural Knowledge, and Opportunity: An Analytical Framework for Modular Performance Modeling13 Sep 2025
- 2024Omnipredicting Single-Index Models with Multi-Index Models20 Nov 2024
- 2024Sample Complexity of the Sign-Perturbed Sums Method2 Sep 2024
- 2023High-Probability Risk Bounds via Sequential Predictors15 Aug 2023
- 2023A new Gradient TD Algorithm with only One Step-size: Convergence Rate Analysis using L-λ Smoothness29 Jul 2023
- 2023Local Risk Bounds for Statistical Aggregation29 Jun 2023
- 2023An Adaptive Algorithm for Learning with Unknown Distribution Drift3 May 2023
- 2023Exploring Local Norms in Exp-concave Statistical Learning21 Feb 2023
12 newest of 16 All 16 (JSON)