Fetching the paper…
Reading the bibliography…
We show that the Rademacher complexity of any $\mathbb{R}^{K}$-valued function class composed with an $\ell_{\infty}$-Lipschitz function is bounded by the maximum Rademacher complexity of the restriction of the function class along each coordinate, times a factor of $\tilde{O}(\sqrt{K})$.
The best constants in the khintchine inequality
Uffe Haagerup · 1981
Earlier work this paper cites.
Probability in Banach Spaces
Michel Ledoux and Michel Talagrand · 1991
Earlier work this paper cites.
Scale-sensitive dimensions, uniform convergence, and learnability
Noga Alon, Shai Ben-David, Nicolo Cesa-Bianchi, and David Haussler · 1997
Earlier work this paper cites.
Prediction, learning, uniform convergence, and scale-sensitive dimensions
Peter L Bartlett and Philip M Long · 1998
Earlier work this paper cites.
Rademacher processes and bounding the risk of function learning
Vladimir Koltchinskii and Dmitry Panchenko · 2000
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.
Combinatorics of random processes and sections of convex bodies
Mark Rudelson and Roman Vershynin · 2006
Cited alongside, same era.
Note on refined dudley integral covering number bound
Nathan Srebro and Karthik Sridharan · 2010
Cited alongside, same era.
Smoothness, low noise and fast rates
Nathan Srebro, Karthik Sridharan, and Ambuj Tewari · 2010
Cited alongside, same era.
Structured prediction theory based on factor graph complexity
Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, and Scott Yang · 2016
Cited alongside, same era.
Testing the manifold hypothesis
Charles Fefferman, Sanjoy Mitter, and Hariharan Narayanan · 2016
Cited alongside, same era.
A vector-contraction inequality for rademacher complexities
Andreas Maurer · 2016
Cited alongside, same era.
Uniform graphical convergence of subgradients in nonconvex optimization and learning
Damek Davis and Dmitriy Drusvyatskiy · 2018
Later among the works it cites.
Uniform convergence of gradients for non-convex learning and optimization
Dylan J Foster, Ayush Sekhari, and Karthik Sridharan · 2018
Later among the works it cites.
Rademacher complexity of k-fold maxima of hyperplanes
Aryeh Kontorovich · 2018
Later among the works it cites.
Improved generalization bounds for robust learning
Idan Attias, Aryeh Kontorovich, and Yishay Mansour · 2019
Closest in time.
Towards understanding the role of over-parametrization in generalization of neural networks
Behnam Neyshabur, Zhiyuan Li, Srinadh Bhojanapalli, Yann LeCun, and Nathan Srebro · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…