arXiv · math/0508275
Local Rademacher complexities
Abstract
We propose new bounds on the error of learning algorithms in terms of a data-dependent notion of complexity. The estimates we establish give optimal rates and are based on a local and empirical version of Rademacher averages, in the sense that the Rademacher averages are computed from the data, on a subset of functions with small empirical error. We present some applications to classification and prediction with convex function classes, and with kernel classes in particular.
Explore related subjects
Keep this discovery
Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson. 2005-08-16. Local Rademacher complexities. https://doi.org/10.1214/009053605000000282
Cite the original work for its findings. Save a collection to share your selection of sources.