The Sample Complexity of Learning Linear Predictors with the Squared Loss

The importance of convexity in learning with squared loss

W. Lee, P. Bartlett, and R. Williamson · 1998

Earlier work this paper cites.

Neural network learning: Theoretical foundations

M. Anthony and P. Bartlett · 1999

Earlier work this paper cites.

Relative loss bounds for on-line density estimation with the exponential family of distributions

K. Azoury and M. Warmuth · 2001

Earlier work this paper cites.

Competitive on-line statistics

V. Vovk · 2001

Earlier work this paper cites.

Optimal rates of aggregation

A. Tsybakov · 2003

Cited alongside, same era.

On the generalization ability of on-line learning algorithms

N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2004

Cited alongside, same era.

Smoothness, low noise and fast rates

N. Srebro, K. Sridharan, and A. Tewari · 2010

Cited alongside, same era.

Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: Ecole d’Eté de Probabilités de Saint-Flour XXXVIII-2008 , volume 2033

V. Koltchinskii · 2011

Cited alongside, same era.

Random design analysis of ridge regression

D. Hsu, S. M Kakade, and T. Zhang · 2014

Closest in time.

Performance of empirical risk minimization in linear aggregation

Original

G. Lecué and S. Mendelson · 2014

Closest in time.

Suboptimality of constrained least squares and improvements via non-linear predictors

Original

Tomas Vaškevičius and Nikita Zhivotovskiy · 2020

Closest in time.