AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Efficient algorithms for linear regression with heteroskedastic errors

Sergei Vassilvitskii, Silvio Lattanzi, Aditya Bhaskara, Siddhant Chaudhary

NeurIPS 2026 · Learning theory and algorithms › Sample complexity · approach: Coresets and sublinear estimation

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.

Studies linear regression with heteroskedastic noise across n sources with unknown variances, focusing on the subset-selection-style estimation problem (abstract truncated).

Problem

Linear regression where n sources each give a linear measurement of an unknown d-dimensional parameter with unknown, possibly unequal noise variances; the abstract is truncated at the classic subset-selection formulation.

Approach

Abstract truncated; the stated focus is on efficient algorithms for the classic heteroskedastic subset-selection formulation of linear regression. Specific technique not stated in the available text.

Limitations

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