Covering numbers for real-valued function classes

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1721-1724

  Bartlett, P L ^a,b   Kulkarni, S R ^a,c   Posner, S E ^d  

^a IEEE   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c Princeton University   (United States)

^d ING Baring Furman Selz LLC   (United States)

Author keywords

Bounded variation; Covering numbers; Fat shattering dimension; Metric entropy; Scale sensitive dimension; VC dimension

Indexed keywords

BOUNDED VARIATION; COVERING NUMBERS; FAT SHATTERING DIMENSION; METRIC ENTROPY; REAL VALUED FUNCTION CLASSES; SCALE SENSITIVE DIMENSION;

COMBINATORIAL MATHEMATICS; ESTIMATION; FUNCTIONS; NUMBER THEORY; SET THEORY; STATISTICS;

INFORMATION THEORY;

EID: 0031235711     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623181     Document Type: Article

References (16)

1. N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler, "Scale-sensitive dimensions, uniform convergence, and learnability," in Proc. ACM Symp. on Foundations of Computer Science, 1993.
2. M. Anthony and P. L. Bartlett, "Function learning from interpolation," in Computational Learning Theory: Proc. 2nd European Conf., EuroCOLT'95, 1995, pp. 211-221.
3. P. L. Bartlett and P. Long, "More theorems about scale-sensitive dimensions and learnability," in Proc. 8th Annu. Conf. on Computational Learning Theory, 1995, pp. 392-401.
4. L. Birgé, "Estimating a density under order restrictions: Nonasymptotic minimax risk," Ann. Statist., vol. 15, pp. 995-1012, 1987.
5. N. Cesa-Bianchi and D. Haussler, "A graph-theoretic generalization of the Sauer-Shelah lemma," DSI, Universitá di Milano, Milano. Italy, Internal Rep. 17096, 1996.
6. R. M. Dudley, "Central limit theorems for empirical measures," Ann. Probab., vol. 6, no. 6, pp. 899-929, 1978.
7. P. Groeneboom, "Some current developments in density estimation," in CWI Monographs. Amsterdam. The Netherlands: North-Holland, 1986.
8. D. Haussler, "Decision theoretic generalizations of the PAC model for neural net and other learning applications," Inform. Comput., vol. 100, pp. 78-150, 1992.
9. _, "Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension," J. Comb. Theory, ser. A, vol. 69, no. 2, p. 217, 1995.
10. A. N. Kolmogorov, "Asymptotic characteristics of some completely bounded metric spaces," Dokl. Akad. Nauk. SSSR, vol. 108, pp. 585-589, 1956.
11. A. N. Kolmogorov and S. V. Fomin, Introductory Real Analysis. New York: Dover, 1970.
12. A. N. Kolmogorov and V. M. Tihomirov, "ε-entropy and ε-capacity of sets in function spaces," Amer. Math. Soc. Transl. (2), vol. 17, pp. 277-364, 1961.
13. S. R. Kulkarni, S. K. Mitter, and J. N. Tsitsiklis, "Active learning using arbitrary binary-valued queries," Mach. Learning, vol. 11, pp. 23-35, 1993.
14. W. S. Lee, P. L. Bartlett, and R. C. Williamson, "On efficient agnostic learning of linear combinations of basis functions," in Proc. 8th Annu. Conf. on Computational Learning Theory, 1995, pp. 369-376.
15. G. G. Lorentz, "Metric entropy and approximation," Bull. Amer. Math. Soc., vol. 72, pp. 903-937, 1966.
16. D. Pollard, Convergence of Stochastic Processes. New York: Springer, 1984.