Localized Rademacher Complexities

  • Peter L. Bartlett
  • Olivier Bousquet
  • Shahar Mendelson
Conference paper

DOI: 10.1007/3-540-45435-7_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2375)
Cite this paper as:
Bartlett P.L., Bousquet O., Mendelson S. (2002) Localized Rademacher Complexities. In: Kivinen J., Sloan R.H. (eds) Computational Learning Theory. COLT 2002. Lecture Notes in Computer Science, vol 2375. Springer, Berlin, Heidelberg

Abstract

We investigate the behaviour of global and local Rademacher averages. We present new error bounds which are based on the local averages and indicate how data-dependent local averages can be estimated without a priori knowledge of the class at hand.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Peter L. Bartlett
    • 1
    • 3
  • Olivier Bousquet
    • 1
    • 2
  • Shahar Mendelson
    • 3
  1. 1.BIOwulf TechnologiesBerkeleyUSA
  2. 2.Centre de Mathématiques AppliquéesEcole PolytechniquePalaiseauFrance
  3. 3.Research School of Information Sciences and EngineeringThe Australian National UniversityCanberraAustralia

Personalised recommendations