Geometric parameters of kernel machines

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2375, Issue , 2002, Pages 29-43

  Mendelson, Shahar ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS;

EIGENVALUES; KERNEL MACHINE;

COMPUTATION THEORY;

EID: 84937392733     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45435-7_3     Document Type: Conference Paper

References (14)

1. K. Ball: Volumes of sections on cubes and related problems, in Lecture Notes in Mathematics 1470, 36-47, Springer-Berlin.
2. P. L. Bartlett, O. Bousquet, S. Mendelson: Localized Rademacher Averages, these proceedings.
3. F. Cucker, S. Smale: On the mathematical foundations of learning, preprint.
4. V. De la Peña, E. Giné: Decoupling: from dependence to independence, Springer, 1999.
5. P. Massart: About the constants in Talagrand's concentration inequality for empirical processes, Annals of Probability, 28(2) 863-884, 2000.
6. S. Mendelson: Rademacher averages and phase transitions in Glivenko-Cantelli classes, IEEE transactions on Information Theory, Jan, 2002.
7. S. Mendelson: Improving the sample complexity using global data, to appear, IEEE transactions on Information Theory.
8. S. Mendelson, R. Vershynin: Entropy, Combinatorial Dimensions and Random Averages, these proceedings.
9. p, Journal of Functional Analysis 80 (1), 109-123, 1988.
10. V. D. Milman, G. Schechtman: Asymptotic theory of finite dimensional normed spaces, Lecture Notes in Mathematics 1200, Springer 1986.
11. G. Pisier: The volume of convex bodies and Banach space geometry, Cambridge University Press, 1989.
12. M. Talagrand: Sharper bounds for Gaussian and empirical processes, Annals of Probability, 22(1), 28-76, 1994.
13. A. W. Van der Vaart, J.A. Wellner: Weak convergence and Empirical Processes, Springer-Verlag, 1996.
14. R. C. Williamson, B. Scheolkopf, A. Smola: Generalization performance of regularization networks and support vector machines via entropy numbers of compact networks, IEEE transactions on Information Theory.