Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

By Peter L. Bartlett, Shahar Mendelson. 2003

3,284 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Statistical Learning Theory

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Sergey Levine
  3. Percy Liang
  4. Quoc V. Le
  5. Mohit Bansal
  6. Ruslan Salakhutdinov
  7. Dacheng Tao
  8. Jianfeng Gao

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Trevor Darrell
  4. Ming-Hsuan Yang
  5. Xiaogang Wang
  6. Jitendra Malik
  7. Andrew Zisserman
  8. Yi Yang

In Statistical Learning Theory

  1. Francis R. Bach
  2. Bernhard Schölkopf
  3. Arthur Gretton
  4. Kenji Fukumizu
  5. Bharath K. Sriperumbudur
  6. Alex Smola
  7. Michael I. Jordan
  8. Jason D. Lee

Citations in the corpus