Rademacher and gaussian complexities: risk bounds and structural results

  • Authors:
  • Peter L. Bartlett;Shahar Mendelson

  • Affiliations:
  • Research School of Information Sciences and Engineering, Australian National University, Canberra 0200, Australia;Research School of Information Sciences and Engineering, Australian National University, Canberra 0200, Australia

  • Venue:
  • The Journal of Machine Learning Research
  • Year:
  • 2003

Quantified Score

Hi-index 0.06

Visualization

Abstract

We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we prove general risk bounds in terms of these complexities. We consider function classes that can be expressed as combinations of functions from basis classes and show how the Rademacher and Gaussian complexities of such a function class can be bounded in terms of the complexity of the basis classes. We give examples of the application of these techniques in finding data-dependent risk bounds for decision trees, neural networks and support vector machines.