# On Least Squares Estimation under Heteroscedastic and Heavy-Tailed Errors

Source: [On Least Squares Estimation under Heteroscedastic and Heavy-Tailed Errors](<https://www.sota2.com/research/paper/68fa57fa1e209131ce9aa478>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:03:40.352Z

Authors: Arun K. Kuchibhotla, Rohit K. Patra

Published: 2019-09-04T20:21:02.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1909.02088>)

[PDF](<https://arxiv.org/pdf/1909.02088.pdf>)