Pith. sign in

REVIEW 2 cited by

Benign Overfitting in Linear Regression

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.11300 v3 pith:BBZVXTGS submitted 2019-06-26 stat.ML cs.LGmath.STstat.TH

classification stat.MLcs.LGmath.STstat.TH
keywords datapredictionbenignoverfittingaccuracycharacterizationlinearregression
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The phenomenon of benign overfitting is one of the key mysteries uncovered by deep learning methodology: deep neural networks seem to predict well, even with a perfect fit to noisy training data. Motivated by this phenomenon, we consider when a perfect fit to training data in linear regression is compatible with accurate prediction. We give a characterization of linear regression problems for which the minimum norm interpolating prediction rule has near-optimal prediction accuracy. The characterization is in terms of two notions of the effective rank of the data covariance. It shows that overparameterization is essential for benign overfitting in this setting: the number of directions in parameter space that are unimportant for prediction must significantly exceed the sample size. By studying examples of data covariance properties that this characterization shows are required for benign overfitting, we find an important role for finite-dimensional data: the accuracy of the minimum norm interpolating prediction rule approaches the best possible accuracy for a much narrower range of properties of the data distribution when the data lies in an infinite dimensional space versus when the data lies in a finite dimensional space whose dimension grows faster than the sample size.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Back from the Future: Key-Value Cache Management by Counter-Causal Surprise

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Past tokens that the model can predict from their future context are evicted from the KV cache, judged by a counter-causal attention pass that reuses cached keys and values.

  2. Understanding Overadaptation in Supervised Fine-Tuning: The Role of Ensemble Methods

    cs.AI 2025-06 conditional novelty 6.0 of 10

    Weight averaging of pretrained and fine-tuned models is shown, in a linear model and on three LLM families, to reduce overadaptation and improve both downstream and retained knowledge.

Pith tools