Local Rademacher complexities

From MaRDI portal
Publication:2583411

DOI10.1214/009053605000000282zbMATH Open1083.62034arXivmath/0508275OpenAlexW3100743579WikidataQ105584239 ScholiaQ105584239MaRDI QIDQ2583411FDOQ2583411


Authors: Olivier Bousquet, Shahar Mendelson, Peter L. Bartlett Edit this on Wikidata


Publication date: 16 January 2006

Published in: The Annals of Statistics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0508275




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: Local Rademacher complexities

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