@inproceedings{c099f9f2624a4c3581738539856866c0,
title = "Rademacher and Gaussian complexities: Risk bounds and structural results",
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.",
author = "Bartlett, {Peter L.} and Shahar Mendelson",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001 ; Conference date: 16-07-2001 Through 19-07-2001",
year = "2001",
doi = "10.1007/3-540-44581-1_15",
language = "English",
isbn = "9783540423430",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "224--240",
editor = "David Helmbold and Bob Williamson",
booktitle = "Computational Learning Theory - 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Proceedings",
address = "Germany",
}