A note on different covering numbers in learning theory

Journal of Complexity

Volumn 19, Issue 5, 2003, Pages 665-671

  Pontil, Massimiliano ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141726806     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0885-064X(03)00033-5     Document Type: Article

References (9)

1. N. Alon, S. Ben-David, N. Cesa-Bianchi, D. Haussler, Scale-sensitive dimensions, uniform convergence, and learnability, J. Assoc. Comput. Mach. 44 (4) (1997) 615-631.
2. N. Aronszajn, Theory of reproducing kernels, Trans. Amer. Math. Soc. 686 (1950) 337-404.
3. F. Cucker, S. Smale, On the mathematical foundations of learning, Bull. Amer. Math. Soc. 39 (1) (2002) 1-49.
4. L. Devroye, G. Lugosi, Combinatorial Methods in Density Estimation, Springer, Berlin, 2001.
5. T. Evgeniou, M. Pontil, T. Poggio, Regularization networks and support vector machines, Adv. Comput. Math. 13 (2000) 1-50.
6. W. Hoeffding, Probability inequality for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (1963) 13-30.
7. A. Kolmogorov, S. Fomin, Introductory Real Analysis, Dover, New York, 1975.
8. S. Smale, D.X. Zhou, Estimating the approximation error in learning theory, Anal. Appl. 1 (2003) 1-25.
9. V.N. Vapnik, Estimation of Dependencies based on Empirical Data, Springer, Berlin, 1982.