Strong minimax lower bounds for learning

Machine Learning

Volumn 30, Issue 1, 1998, Pages 31-56

  Antos, Andras ^a   Lugosi, Gábor ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Lower bounds; PAC learning; Vapnik Chervonenkis dimension

Indexed keywords

ERRORS; NEURAL NETWORKS; PROBABILITY; RANDOM PROCESSES; SET THEORY;

PAC LEARNING; VAPNIK-CHERVONENKIS DIMENSION;

LEARNING SYSTEMS;

EID: 0031698444     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007454427662     Document Type: Article

References (13)

1. Antos, A., & Lugosi, G. (1996). Strong minimax lower bounds for learning. Proceedings of the Ninth Annual ACM Conference on Computational Learning Theory (pp. 303-309). New York: Association for Computing Machinery.
2. Assouad, P. (1983). Densité et dimension. Annales de l'Institut Fourier, 33:233-282.
3. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:929-965.
4. Devroye, L., & Lugosi, G. (1995). Lower bounds in pattern recognition and learning. Pattern Recognition, 28:1011-1018.
5. Devroye, L., Györfi, L., & Lugosi, G. (1996). A Probabilistic Theory of Pattern Recognition. New York: Springer-Verlag.
6. Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989). A general lower bound on the number of examples needed for learning. Information and Computation, 82:247-261.
7. Haussler, D., Littlestone, N., & Warmuth, M. (1994). Predicting {0, 1}-functions on randomly drawn points. Information and Computation, 115:248-292.
8. Lugosi, G. (1995). Improved upper bounds for probabilities of uniform deviations. Statistics and Probability Letters, 25:71-77.
9. Reiss, R.-D. (1989). Approximate Distributions of Order Statistics. New York: Springer-Verlag.
10. Schuurmans, D. (1995). Characterizing rational versus exponential learning curves. Computational Learning Theory: Second European Conference. EuroCOLT'95 (pp. 272-286). New York: Springer-Verlag.
11. Shawe-Taylor, J., Anthony, M., & Biggs, N.L. (1993). Bounding sample size with the Vapnik-Chervonenkis dimension. Discrete Applied Mathematics, 42:65-73.
12. Vapnik, V.N., & Chervonenkis, A.Ya. (1979). Theory of Pattern Recognition. Moscow: Nauka, 1974 (in Russian);
13. German translation: Theorie der Zeichenerkennung, Berlin: Akademie Verlag.