Localized Rademacher complexities

DOI10.1007/3-540-45435-7_4MaRDI QIDQ3046694zbMATH OpenFDO

Authors Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2375/23750044.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Local Rademacher complexities
• A local Vapnik-Chervonenkis complexity
• 10.1162/153244303321897690
• Rademacher and Gaussian complexities: Risk bounds and structural results
• Local Rademacher complexity: sharper risk bounds with and without unlabeled samples

Cited in

(14)

• Rademacher complexity in Neyman-Pearson classification
• Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
• ``Local vs. ``global parameters -- breaking the Gaussian complexity barrier
• Relative deviation learning bounds and generalization with unbounded loss functions
• Moment inequalities for functions of independent random variables
• The shattering dimension of sets of linear functionals.
• Complexity regularization via localized random penalties
• A local Vapnik-Chervonenkis complexity
• Fast learning rates in statistical inference through aggregation
• Aspects of discrete mathematics and probability in the theory of machine learning
• Concentration inequalities and asymptotic results for ratio type empirical processes
• Local Rademacher complexities
• Multi-kernel learning for multi-label classification with local Rademacher complexity
• Oracle inequalities for support vector machines that are based on random entropy numbers

This page was built for publication: Localized Rademacher complexities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046694)