Rademacher and Gaussian complexities: Risk bounds and structural results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2111, Issue , 2001, Pages 224-240

  Bartlett, Peter L ^a   Mendelson, Shahar ^b  

^a BIOwulf Technologies   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; DECISION TREES; SUPPORT VECTOR MACHINES; TREES (MATHEMATICS);

DATA DEPENDENT; DECISION-THEORETIC; FUNCTION CLASS; GAUSSIAN COMPLEXITY; RISK BOUNDS;

GAUSSIAN DISTRIBUTION;

EID: 84943261848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44581-1_15     Document Type: Conference Paper

References (21)

1. Peter L. Bartlett. The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 44(2):525–536, 1998.
2. Peter L. Bartlett, Stèphane Boucheron, and Gàbor Lugosi. Model selection and error estimation. Machine Learning, 2001. (To appear).
3. Mostefa Golea, Peter L. Bartlett, and Wee Sun Lee. Generalization in decision trees and DNF: Does size matter? In NIPS 10, pages 259–265, 1998.
4. Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, and Dana Ron. An experimental and theoretical comparison of model selection methods. Machine Learning, 27:7–50, 1997.
5. V. Koltchinskii.: Rademacher penalties and structural risk minimization. Technical report, Department of Mathematics and Statistics, University of New Mexico, 2000.
6. V. Koltchinskii and D. Panchenko. Empirical margin distributions and bounding the generalization error of combined classifiers. Technical report, Department of Mathematics and Statistics, University of New Mexico, 2000.
7. V. Koltchinskii and D. Panchenko. Rademacher processes and bounding the risk of function learning. Technical report, Department of Mathematics and Statistics, University of New Mexico, 2000.
8. E. B. Kong and T. G. Dietterich. Error-correcting output coding corrects bias and variance. In Proc. 12th International Conference on Machine Learning, pages 313–321. Morgan Kaufmann, 1995.
9. M. Ledoux and M. Talagrand. Probability in Banach Spaces:isop erimetry and processes. Springer, 1991.
10. Llew Mason, Peter L. Bartlett, and Jonathan Baxter. Improved generalization through explicit optimization of margins. Machine Learning, 38(3):243–255, 2000.
11. C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics 1989, pages 148–188. Cambridge University Press, 1989.
12. Shahar Mendelson. l-norm and its application to learning theory. Positivity, 2001. (To appear—see http://www.axiom.anu.edu.au/∼shahar.).
13. Shahar Mendelson. Rademacher averages and phase transitions in Glivenko- Cantelli classes. (see http://www.axiom.anu.edu.au/∼shahar), 2001.
14. Shahar Mendelson. Some remarks on covering numbers. (unpublished manuscript—see http://www.axiom.anu.edu.au/∼shahar), 2001.
15. G. Pisier. The volume of convex bodies and Banach space geometry. Cambridge University Press, 1989.
16. Robert E. Schapire. Using output codes to boost multiclass learning problems. In Machine Learning:Pr oc. Fourteenth International Conference, pages 313–321, 1997.
17. Robert E. Schapire, Yoav Freund, Peter L. Bartlett, and Wee Sun Lee. Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics, 26(5):1651–1686, October 1998.
18. John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson, and Martin Anthony. Structural risk minimisation over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5):1926–1940, 1998.
19. N. Tomczak-Jaegermann. Banach-Mazur distance and finite-dimensional operator ideals. Number 38 in Pitman Monographs and Surveys in Pure and Applied Mathematics. Pitman, 1989.
20. Vladimir N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264–280, 1971.
21. R. C. Williamson, A. J. Smola, and B. Schölkopf.: Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators. IEEE Transactions on Information Theory, 2001. (To appear).