Learning relatively small classes

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

Volumn 2111, Issue , 2001, Pages 273-288

  Mendelson, Shahar ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COVERING NUMBERS; LEARNING PROBLEM; LOSS FUNCTIONS; SAMPLE COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

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

References (11)

1. M. Anthony, P.L. Bartlett: Neural Network Learning: Theoretical Foundations, Cambridge University Press, 1999.
2. B. Beauzamy: Introduction to Banach spaces and their Geometry, Math. Studies, vol 86, North-Holland, 1982
3. O. Hanner: On the uniform convexity of Lp and lp, Ark. Math. 3, 239-244, 1956.
4. P. Habala, P. Hàjek, V. Zizler: Introduction to Banach spaces vol I andI I, matfyzpress, Univ. Karlovy, Prague, 1996.
5. W.S. Lee: Agnostic learning and single hidden layer neural network, Ph.D. thesis, The Australian National University, 1996.
6. W.S. Lee, P.L. Bartlett, R.C. Williamson: The Importance of Convexity in Learning with SquaredLoss, IEEE Transactions on Information Theory 44 5, 1974-1980, 1998.
7. S. Mendelson: Rademacher averages and phase transitions in Glivenko–Cantelli classes, preprint.
8. S. Mendelson: Geometric methods in the analysis of Glivenko-Cantelli classes, this volume.
9. M. Talagrand: Sharper bounds for Gaussian and empirical processes, Annals of Probability, 22(1), 28-76, 1994.
10. A.W. Van-de-Vaart, J.A. Wellner: Weak convergence and Empirical Processes, Springer-Verlag, 1996.
11. R.C. Williamson, A.J. Smola, B. Schölkopf: Generalization performance of regularization networks andsupp ort vectors machines via entropy numbers of compact operators, to appear in IEEE transactions on Information Theory.