PofoliaShared via Pofolia

Mathematical Statistics and Learning· 2026Q1

Estimating a regression function under possible heteroscedastic and heavy-tailed errors. Application to shape-restricted regression

Yannick Baraud, Guillaume Maillard

Short summary

A new regression estimator achieves near-optimal performance even with heteroscedastic and heavy-tailed errors, outperforming classical least squares (LSE) which can fail entirely in such conditions.

AI-generated from the title and abstract; the full text is not read.

Key points

  • A new regression estimator is proposed, offering an oracle-type inequality for risk bounds.
  • The estimator is stable under heteroscedastic and heavy-tailed errors (p in [1,2]).
  • It can converge at a parametric rate (up to log factor) where LSE is inconsistent.
  • Performance is demonstrated on shape-restricted regression functions (piecewise monotone, convex/concave).

AI-generated from the title and abstract; the full text is not read.

Abstract

We consider a regression framework where the design points are deterministic and the errors possibly non-i.i.d. and heavy-tailed (with a moment of order p in [1,2] ). Given a class of candidate regression functions, we propose a surrogate for the classical least squares estimator (LSE). For this new estimator, we establish a nonasymptotic risk bound with respect to the absolute loss which takes the form of an oracle-type inequality. This inequality shows that our estimator possesses natural adaptation properties with respect to some elements of the class. When this class consists of monotone functions or convex functions on an interval, these adaptation properties are similar to those established in the literature for the LSE. However, unlike the LSE, we prove that our estimator remains stable with respect to a possible heteroscedasticity of the errors and may even converge at a parametric rate (up to a logarithmic factor) when the LSE is not even consistent. We illustrate the performance of this new estimator over classes of regression functions that satisfy a shape constraint: piecewise monotone, piecewise convex/concave, among other examples. The paper also contains some approximation results by splines with degrees in \{0,1\} and VC bounds for the dimensions of classes of level sets. These results may be of independent interest.

The authors' abstract, as published at the source. Mathematical Statistics and Learning, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Statistics and Probability

Statistics and ProbabilityMathematics