AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Optimal Linear Regression Without a Variance

Artin Tajdini, Jasper C.H. Lee, Jonathan Scarlett, Kevin Jamieson

NeurIPS 2026 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Gives a black-box reduction that turns finite-variance linear regression procedures into ones that work under only a weak (finite alpha-moment, alpha in (1,2)) noise assumption, via empirical residual pruning.

Problem

High-probability linear regression when the noise has only a finite conditional alpha-moment for unknown alpha in (1,2), so variance is infinite, and covariates may also be heavy-tailed.

Approach

A black-box reduction based on empirical residual pruning converts any finite-variance regression procedure into a weak-moment procedure, agnostic to the unknown alpha.

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy