A graph-theoretic generalization of the Sauer-Shelah lemma

Discrete Applied Mathematics

Volumn 86, Issue 1, 1998, Pages 27-35

  Cesa Bianchi, Nicolò ^a   Haussler, David ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b University of California Santa Cruz   (United States)

Author keywords

Metric space; Packing number; Vapnik Chervonenkis dimension

Indexed keywords

EID: 0345767185     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00012-2     Document Type: Article

References (16)

1. N. Alon, S. Ben-David, N. Cesa-Bianchi, D. Haussler, Scale-sensitive dimensions, uniform convergence, and learnability, J. ACM 44 (1997) 615-631.
2. D. Angluin, L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. Systems Sci. 18 (1979) 155-193.
3. P.L. Bartlett, S.R. Kulkarni, S.E. Posner, Covering numbers for real-valued function classes, IEEE Trans. Inform. Theory. 43(1997) 1721-1725.
4. R.M. Dudley, Central limit theorems for empirical measures, Ann. Probab. 6 (1979) 899-929, Correction in 7 (1979) 909-911.
5. R.M. Dudley, E. Giné, J. Zinn, Uniform and universal Glivenko-Cantelli classes, J. Theoret. Probab. 4 (1991) 485-510.
6. L. Gargano, J. Körner, U. Vaccaro, Capacities: from information theory to extremal set theory, J. Combin. Theory Ser. A 68 (1994) 296-316.
7. D. Haussler, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Inform. Comput. 100 (1) (1992) 78-150.
8. D. Haussler, Sphere packing numbers for subsets of the boolean n-cube with bounded Vapnik-Chervonenkis dimension, J. Combin. Theory Ser. A 69 (2) (1995) 217-232.
9. D. Haussler, P.M. Long, A generalization of Sauer's lemma, J. Combin. Theory Ser. A 71 (1995) 219-240.
10. M. Kearns, R.E. Schapire, Efficient distribution-free learning of probabilistic concepts, J. Comput. Systems Sci. 48 (3) (1994) 464-497. An extended abstract appeared in the proc. 30th Ann. Symp. on the Foundations of Computer Science.
11. W.S. Lee, P. Bartlett, R.C. Williamson, On efficient agnostic learning of linear combinations of basis functions. In Proceedings of the 8th Annual Conference on Computational Learning Theory, pages 369-376. ACM Press, 1995.
12. D. Pollard, Empirical Processes : Theory and Applications, NSF-CBMS Regional Conference Series in Probability and Statistics, vol. 2, Institute of Math. Stat. and Am. Stat. Assoc., 1990.
13. N. Sauer, On the density of families of sets, J. Combin. Theory Ser. A 13 (1972) 145-147.
14. C.E. Shannon, The zero-error capacity of a noisy channel, IRE Trans. Inform. Theory 2 (1956) 8-19.
15. S. Shelah, A combinatorial problem: Stability and order for models and theories in infinitary languages, Pacific J. Math. 41 (1972) 247-261.
16. V.N. Vapnik, A.Y. Chervonenkis, Or the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 6 (2) (1971) 264-280.