Local Rademacher Complexity: Sharper risk bounds with and without unlabeled samples
- 1 May 2015
- journal article
- Published by Elsevier in Neural Networks
- Vol. 65, 115-125
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An improved analysis of the Rademacher data-dependent bound using its self bounding propertyNeural Networks, 2013
- Tighter PAC-Bayes bounds through distribution-dependent priorsTheoretical Computer Science, 2013
- Fast learning rates for plug-in classifiersThe Annals of Statistics, 2007
- Local Rademacher complexities and oracle inequalities in risk minimizationThe Annals of Statistics, 2006
- Discussion: Local Rademacher complexities and oracle inequalities in risk minimizationThe Annals of Statistics, 2006
- Local Rademacher complexitiesThe Annals of Statistics, 2005
- Are Loss Functions All the Same?Neural Computation, 2004
- Model Selection and Error EstimationMachine Learning, 2002
- A Bennett concentration inequality and its application to suprema of empirical processesComptes Rendus Mathématique, 2002
- A sharp concentration inequality with applicationsRandom Structures & Algorithms, 2000