mlsanityData to 14 Oct 2026

The Sample Complexity of Learning Linear Predictors with the Squared Loss

arXiv 1406.5143 ↗First posted 19 Jun 2014cs.LG stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

In this short note, we provide a sample complexity lower bound for learning linear predictors with respect to the squared loss. Our focus is on an agnostic setting, where no assumptions are made on the data distribution. This contrasts with standard results in the literature, which either make distributional assumptions, refer to specific parameter settings, or use other performance measures.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Jun 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 5; 2024: 2; 2025: 1; 2026: 4.

16 papers.

Sort: