Size-Independent Sample Complexity of Neural Networks

Probability in Banach Spaces

Michel Ledoux and Michel Talagrand · 1991

Earlier work this paper cites.

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Peter L Bartlett · 1998

Earlier work this paper cites.

Rademacher and gaussian complexities: Risk bounds and structural results

Peter L Bartlett and Shahar Mendelson · 2002

Earlier work this paper cites.

Empirical margin distributions and bounding the generalization error of combined classifiers

Vladimir Koltchinskii and Dmitry Panchenko · 2002

Earlier work this paper cites.

Neural network learning: Theoretical foundations

Martin Anthony and Peter L Bartlett · 2009

Cited alongside, same era.

Concentration inequalities: A nonasymptotic theory of independence

Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013

Cited alongside, same era.

In search of the real inductive bias: On the role of implicit regularization in deep learning

Original

Behnam Neyshabur, Ryota Tomioka, and Nathan Srebro · 2014

Cited alongside, same era.

Understanding machine learning: From theory to algorithms

Shai Shalev-Shwartz and Shai Ben-David · 2014

Cited alongside, same era.

Norm-based capacity control in neural networks

Behnam Neyshabur, Ryota Tomioka, and Nathan Srebro · 2015

Later among the works it cites.

Understanding deep learning requires rethinking generalization

Original

Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, and Oriol Vinyals · 2016

Later among the works it cites.

Spectrally-normalized margin bounds for neural networks

Original

Peter Bartlett, Dylan J Foster, and Matus Telgarsky · 2017

Closest in time.

A pac-bayesian approach to spectrally-normalized margin bounds for neural networks

Original

Behnam Neyshabur, Srinadh Bhojanapalli, David McAllester, and Nathan Srebro · 2017

Closest in time.