Understand
We investigate the capacity, convexity and characterization of a general family of norm-constrained feed-forward networks.
Built on
The best constants in the khintchine inequality
Uffe Haagerup · 1981
Earlier work this paper cites.
Efficient agnostic learning of neural networks with bounded fan-in
Wee Sun Lee, Peter L Bartlett, and Robert C Williamson · 1996
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.
Empirical margin distributions and bounding the generalization error of combined classifiers
Vladimir Koltchinskii and Dmitry Panchenko · 2002
Earlier work this paper cites.
Rademacher and gaussian complexities: Risk bounds and structural results
Peter L. Bartlett and Shahar Mendelson · 2003
Earlier work this paper cites.
Convex neural networks
Yoshua Bengio, Nicolas L. Roux, Pascal Vincent, Olivier Delalleau, and Patrice Marcotte · 2005
Earlier work this paper cites.
Similar
Cryptographic hardness for learning intersections of halfspaces
Adam R Klivans and Alexander A Sherstov · 2006
Cited alongside, same era.
Neural network learning: Theoretical foundations
Martin Anthony and Peter L. Bartlett · 2009
Cited alongside, same era.
Kernel methods for deep learning
Youngmin Cho and Lawrence K. Saul · 2009
Cited alongside, same era.
On the complexity of linear prediction: Risk bounds, margin bounds, and regularization
Sham M Kakade, Karthik Sridharan, and AmbujTewari · 2009
Cited alongside, same era.
Rectified linear units improve restricted boltzmann machines
Vinod Nair and Geoffrey E. Hinton · 2010
Cited alongside, same era.
Deep sparse rectifier networks
Xavier Glorot Antoine Bordes and Yoshua Bengio · 2011
Cited alongside, same era.
Then
On rectified linear units for speech processing
M.D. Zeiler, M. Ranzato, R. Monga, M. Mao, K. Yang, Q.V. Le, P. Nguyen, A. Senior, V. Vanhoucke, J. Dean, and G.E. Hinton · 2013
Later among the works it cites.
Breaking the curse of dimensionality with convex neural networks
Francis Bach · 2014
Later among the works it cites.
A new perspective on learning linear separators with large lqlp margins
Maria-Florina Balcan and Christopher Berlind · 2014
Later among the works it cites.
From average case complexity to improper learning complexity
Amit Daniely, Nati Linial, and Shai Shalev-Shwartz · 2014
Later among the works it cites.
On the computational efficiency of training neural networks
Roi Livni, Shai Shalev-Shwartz, and Ohad Shamir · 2014
Later among the works it cites.
Understanding Machine Learning: From Theory to Algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Later among the works it cites.
Beyond the bibliography
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…