On Least Squares Estimation under Heteroscedastic and Heavy-Tailed Errors
Not on the map. Why?
Abstract (arXiv)
We consider least squares estimation in a general nonparametric regression model. The rate of convergence of the least squares estimator (LSE) for the unknown regression function is well studied when the errors are sub-Gaussian. We find upper bounds on the rates of convergence of the LSE when the errors have uniformly bounded conditional variance and have only finitely many moments. We show that the interplay between the moment assumptions on the error, the metric entropy of the class of functions involved, and the "local" structure of the function class around the truth drives the rate of convergence of the LSE. We find sufficient conditions on the errors under which the rate of the LSE matches the rate of the LSE under sub-Gaussian error. Our results are finite sample and allow for heteroscedastic and heavy-tailed errors.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1; 2026: 1.
4 papers.
- 2022How do noise tails impact on deep ReLU networks?cited by 25
- 2025Regularized least squares learning with heavy-tailed noise is minimax optimalcited by 3
- 2024Causal Inference for Genomic Data with Multiple Heterogeneous Outcomescited by 1
- 2026Mitigating the Curse of Dimensionality in Uniform Convergence of Deep Neural Networks via Smooth Activationscited by 0
- 2026Mitigating the Curse of Dimensionality in Uniform Convergence of Deep Neural Networks via Smooth Activations4 Jun 2026
- 2025Regularized least squares learning with heavy-tailed noise is minimax optimal20 May 2025
- 2024Causal Inference for Genomic Data with Multiple Heterogeneous Outcomes14 Apr 2024
- 2022How do noise tails impact on deep ReLU networks?20 Mar 2022