Localized rademacher complexities

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

Volumn 2375, Issue , 2002, Pages 44-58

  Bartlett, Peter L ^a,c   Bousquet, Olivier ^a,b   Mendelson, Shahar ^c  

^a BIOwulf Technologies   (United States)

^b CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS;

DATA DEPENDENT; ERROR BOUND; LOCAL AVERAGE; PRIORI KNOWLEDGE; RADEMACHER COMPLEXITY;

COMPUTATION THEORY;

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

References (12)

1. P. L. Bartlett, S. Boucheron and G. Lugosi. Model selection and error estimation. Machine Learning, 48, 85-113, 2002.
2. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. Proceedings of the Fourteenth Annual Conference on Computational Learning Theory, pp. 224-240, 2001.
3. S. Boucheron, G. Lugosi and P. Massart. Concentration inequalities using the entropy method. Preprint, CNRS-Université Paris-Sud. 2002.
4. O. Bousquet. A Bennett concentration inequality and its application to empirical processes. C. R. Acad. Sci. Paris, Ser. I, 334, pp. 495-500, 2002.
5. V. I. Koltchinskii. Rademacher penalties and structural risk minimization. Technical report, University of New Mexico, 2000.
6. V. I. Koltchinskii and D. Panchenko. Rademacher processes and bounding the risk of function learning. In High Dimensional Probability II, Eds. E. Gine, D. Mason and J. Wellner, pp. 443-459, 2000.
7. W. S. Lee, P. L. Bartlett and R. C. Williamson. Efficient agnostic learning of neural networks with bounded fan-in. IEEE Transactions on Information Theory, 42(6), 2118-2132, 1996.
8. P. Massart. Some applications of concentration inequalities to statistics. Annales de la Faculté des Sciences de Toulouse, IX:245-303, 2000.
9. S. Mendelson. Improving the sample complexity using global data. IEEE Transactions on Information Theory, 2002.
10. S. Mendelson and R. C. Williamson Agnostic learning nonconvex classes of function. To appear in Proceedings of the Fifteenth Annual Conference on Computational Learning Theory, 2002.
11. E. Rio Une inegalité de Bennett pour les maxima de processus empiriques. Colloque en l'honneur de J. Bretagnolle, D. Dacunha-Castelle et I. Ibragimov, 2001.
12. A. W. van der Vaart and J. A. Wellner. Weak Convergence and Empirical Processes. Springer, 1996.