Fetching the paper…
Reading the bibliography…
We establish an excess risk bound of O(H R_n^2 + R_n \sqrt{H L*}) for empirical risk minimization with an H-smooth loss function and a hypothesis class with Rademacher complexity R_n, where L* is the best risk achievable by the hypothesis class.
Central limit theorems for empirical measures
R. M. Dudley · 1978
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. Yudin · 1978
Earlier work this paper cites.
Convergence of Stochastic Processes
David Pollard · 1984
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Scale-sensitive dimensions, uniform convergence, and learnability
N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler · 1997
Earlier work this paper cites.
The importance of convexity in learning with squared loss
W. S. Lee, P. L. Bartlett, and R. C. Williamson · 1998
Earlier work this paper cites.
Some applications of concentration inequalities to statistics
P. Massart · 2000
Earlier work this paper cites.
Rademacher and Gaussian complexities: Risk bounds and structural results
P. L. Bartlett and S. Mendelson · 2002
Earlier work this paper cites.
Concentration Inequalities and Empirical Processes Theory Applied to the Analysis of Learning Algorithms
O. Bousquet · 2002
Earlier work this paper cites.
Stability and generalization
O. Bousquet and A. Elisseeff · 2002
Earlier work this paper cites.
Empirical margin distributions and bounding the generalization error of combined classifiers
V. Koltchinskii and D. Panchenko · 2002
Earlier work this paper cites.
Rademacher averages and phase transitions in Glivenko-Cantelli classes
Shahar Mendelson · 2002
Earlier work this paper cites.
Some extensions of an inequality of Vapnik and Chervonenkis
D. Panchenko · 2002
Earlier work this paper cites.
Convex analysis in general vector spaces
C. Zalinescu · 2002
Cited alongside, same era.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Cited alongside, same era.
PAC-Bayes & margins
J. Langford and J. Shawe-Taylor · 2003
Cited alongside, same era.
Simplified PAC-Bayesian margin bounds
D. A. McAllester · 2003
Cited alongside, same era.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 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.
High-dimensional generalized linear models and the lasso
S. A. van de Geer · 2008
Later among the works it cites.
Simultaneous analysis of Lasso and Dantzig selector
P. J. Bickel, Y. Ritov, and A. B. Tsybakov · 2009
Later among the works it cites.
Adapting to unknown smoothness by aggregation of thresholded wavelet estimators
C. Chesneau and G. Lecué · 2009
Later among the works it cites.
On the complexity of linear prediction: Risk bounds, margin bounds, and regularization
S.M. Kakade, K. Sridharan, and A. Tewari · 2009
Later among the works it cites.
Sparsity in penalized empirical risk minimization
V. Koltchinskii · 2009
Later among the works it cites.
Convex Optimization Under Inexact First-order Information
G. Lan · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Tsybakov · 2004
Cited alongside, same era.
Local Rademacher complexities
P. L. Bartlett, O. Bousquet, and S. Mendelson · 2005
Cited alongside, same era.
Complexities of convex combinations and bounding the generalization error in classification
Vladimir Koltchinskii and Dmitry Panchenko · 2005
Cited alongside, same era.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
Online Learning: Theory, Algorithms, and Applications
S. Shalev-Shwartz · 2007
Cited alongside, same era.
Fast rates for support vector machines using Gaussian kernels
I. Steinwart and C. Scovel · 2007
Cited alongside, same era.
Stochastic convex optimization
S. Shalev-Shwartz, O. Shamir, N. Srebro, and K. Sridharan · 2009
Later among the works it cites.
Trading accuracy for sparsity in optimization problems with sparsity constraints
S. Shalev-Shwartz, N. Srebro, and T. Zhang · 2009
Later among the works it cites.
Asymptotically optimal regularization in smooth parametric models
P. Liang, F. Bach, G. Bouchard, and M. I. Jordan · 2010
Closest in time.
On the interaction between norm and dimensionality: Multiple regimes in learning
P. Liang and N. Srebro · 2010
Closest in time.
Note on refined Dudley integral covering number bound, 2010
N. Srebro and K. Sridharan · 2010
Closest in time.
Concentration-based guarantees for low-rank matrix reconstruction
R. Foygel and N. Srebro · 2011
Closest in time.