Distribution-dependent vapnik-chervonenkis bounds

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

Volumn 1572, Issue , 1999, Pages 230-240

  Vayatis, Nicolas ^a,b   Azencott, Robert ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

GENERALIZATION ABILITY; LARGE DEVIATIONS; LEARNING MACHINES; LEARNING STRUCTURE; R TRANSFORMS; RATES OF CONVERGENCE; STATISTICAL LEARNING THEORY; VC DIMENSION;

LEARNING SYSTEMS;

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

References (26)

1. Alexander, K.: Probability Inequalities for Empirical Processes and a Law of the Iterated Logarithm. Annals of Probability 4 (1984) 1041-1067.
2. Azencott, R.: Grandes Deviations, in Hennequin, P. L. (ed.): Ecole d'Ete de Proba-bilites de Saint-Flour VIII-1978. Lecture Notes in Mathematics, Vol. 774. SpringerVerlag, Berlin Heidelberg New York (1978).
3. Bartlett, P., Lugosi, G.: An Inequality for Uniform Deviations of Sample Averages from their Means. To appear (1998).
4. Cohn, D., Tesauro, G.: How Tight Are the Vapnik-Chervonenkis Bounds? Neural Computation 4 (1992) 249-269.
5. Cohn, D.: Separating Formal Bounds from Practical Performance in Learning Systems. PhD thesis, University of Washington (1992).
6. Devroye, L.: Bounds for the Uniform Deviation of Empirical Measures. Journal of Multivariate Analysis 12 (1982) 72-79.
7. Devroye, L., Gyorfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Springer-Verlag, Berlin Heidelberg New York (1996).
8. Haussler, D.: Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension. Journal of Combinatorial Theory, Series A 69 (1995) 217-232.
9. Haussler, D., Kearns, M., Seung, H. S., Tishby, N.: Rigorous Learning Curve Bounds from Statistical Mechanics. Machine Learning (1996) 195-236.
10. Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association 58 (1963) 13-30.
11. Kearns, M. J., Vazirani, U. V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge Massachussets (1994).
12. Ledoux, M., Talagrand, M.: Probability in Banach Spaces. Springer-Verlag, Berlin Heidelberg New York (1992).
13. Lugosi, G.: Improved Upper Bounds for Probabilities of Uniform Deviations. Statistics and Probability Letters 25 (1995) 71-77.
14. Massart, P.: Rates of Convergence in the Central Limit Theorem for Empirical Processes. Annales de l'Institut Henri Poincare, Vol. 22, No. 4 (1986) 381-423.
15. Parrondo, J. M. R., Van den Broeck, C.: Vapnik-Chervonenkis Bounds for Generalization. J. Phys. A: Math. Gen. 26 (1993) 2211-2223.
16. Pollard, D.: Convergence of Stochastic Processes. Springer-Verlag, Berlin Heidelberg New York (1984).
17. Schuurmans, D. E.: Effective Classification Learning. PhD thesis, University of Toronto (1996).
18. Stroock, D. W.: Probability Theory, an Analytic View. Cambridge University Press (1993).
19. Talagrand, M.: Sharper Bounds for Gaussian and Empirical Processes. The Annals of Probability, Vol. 22, No. 1 (1994) 28-76.
20. van der Vaart, A. W., Wellner, J. A.: Weak Convergence and Empirical Processes. Springer-Verlag, Berlin Heidelberg New York (1996).
21. Vapnik, V. N., Chervonenkis, A. Ya.: On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Theory of Probability and its Applications, Vol. XVI, No. 2 (1971) 264-280.
22. Vapnik, V. N., Chervonenkis, A. Ya.: Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations. Theory of Probability and its Applications, Vol. XXVI, No. 3 (1981) 532-553.
23. Vapnik, V. N.: Estimation of Dependences Based on Empirical Data. Springer-Verlag, Berlin Heidelberg New York (1982).
24. Vapnik, V. N., Levin, E., Le Cun, Y.: Measuring the VC Dimension of a Learning Machine. Neural Computation 6 (1994) 851-876.
25. Vapnik, V. N.: The Nature of Statistical Learning Theory. Springer-Verlag, Berlin Heidelberg New York (1995).
26. Vayatis, N.: Learning Complexity and Pattern Recognition. PhD thesis, Ecole Polytechnique. To appear (1999).