Fat-shattering and the learnability of real-valued functions

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn Part F129415, Issue , 1994, Pages 299-310

  Bartlett, Peter L ^a   Long, Philip M ^b   Williamson, Robert C ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN NOISE (ELECTRONIC);

AGNOSTIC SETTING; FUNCTION CLASS; FUNCTION VALUES; LEARNABILITY; OBSERVATION NOISE; REAL-VALUED FUNCTIONS; VAPNIK-CHERVONENKIS DIMENSIONS;

COMPUTATION THEORY;

EID: 84955592917     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/180139.181158     Document Type: Conference Paper

References (23)

1. N. Alon, S. Ben-David, N. Cesa-Bianchi and D. Haus-sler, Scale-sensitive dimensions, uniform convergence, and learnability, Symposium on Foundations of Computer Science, 1993.
2. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Journal of Computer and System Sciences, 18 (1979), pp. 155-193.
3. M. Anthony and J. Shawe-Taylor, Valid generalization from approximate interpolation, Proceedings of the 1993 IMA European Conference on Computational Learning Theory, to appear.
4. P. Auer, P. M. Long, W. Maass and G. J. Woeginger, On the complexity of function learning, Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 1993.
5. P. Auer and P. M. long, Simulating access to hidden information while learning, Proceedings of the 26th Annual ACM Symposium on the Theory of Computation, 1994.
6. P. L. Bartlett, Learning with a slowly changing distribution, Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 1992.
7. S. Ben-David, N. Cesa-Bianchi, D. Haussler and P. long, Characterizations of learnability for classes of {0,..., n}-valued functions, Manuscript, an earlier version was presented at the Fifth Annual ACM Workshop on Computational Learning Theory, 1993.
8. G. BBNEDEK and A. Itai, Learnability with respect to fixed distributions, Theoretical Computer Science, 86(1991), pp. 377-389.
9. A. Blumer, A. Ehrenfeucht, D. Haussler and M. K. warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the Association for Computing Machinery, 36 (1989), pp. 929-965.
10. S. van de Geer, Regression Analysis and Empirical Processes, Centrum voor Wiskunde en Informauca, Amsterdam, 1988.
11. D. haussler, Decision theoretic generalizations of the PAC model for neural net and other learning apphcations, Information and Computation, 100(1992), pp. 78-150.
12. M. J. kearns and R. E. schapire, Efficient distribution-free learning of probabilistic concepts (extended abstract), Proceedings of the 31 st Annual Symposium on the Foundations of Computer Science, 1990.
13. M. J. Kearns, R. E. Schapire and L. M. Sellie, Toward efficient agnostic learning, Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 1992.
14. N. Merhav and M. Feder, Universal schemes for sequential decision from individual data sequences, IEEE Transaction on Information Theory, 39 (1993), pp. 1280-1292.
15. B. K. Natarajan, On learning sets and functions, Machine Learning, 4 (1989), pp. 67-97.
16. B. K. Natarajan, Occam's razor for functions, Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 1993.
17. J. K. Patel and C. B. Read, The Big Book of Facts About the Normal Distribution, Marcel Dekker, New York, 1982.
18. D. Pollard, Convergence of Stochastic Processes, Springer, New York, 1984.
19. H. L. royden, Real Analysis, Macmillan, New York, 1988.
20. J. Shawe-Taylor, M. Anthony and N. Biggs, Bounding sample size with the Vapnik-Chervonenkis dimension, Discrete Applied Mathematics, 42 (1993), pp. 65-73.
21. h. U. Simon, Bounds on the number of examples needed for learning functions, FB Informatik, LS II, Universitat Dortmund, Forschungsbericht Nr. 501, 1993.
22. L. G. Valiant, A theory of the learnable, Communications of the ACM, 27(1984), pp. 1134-1143.
23. V. N. Vapnik and A. Y. Chervonenkis, On the uniform convergence of relative frequencies of events to theirprob-abiMes, Theory of Probability and its Apphcations, XVI (1971), pp. 264-280.