Nonuniform learnability

Journal of Computer and System Sciences

Volumn 48, Issue 2, 1994, Pages 311-323

  Benedek, Gyora M ^a   Itai, Alon ^b  

^a Elbit Ltd   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; ERRORS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; RECURSIVE FUNCTIONS; SET THEORY;

NONUNIFORM LEARNABILITY;

LEARNING SYSTEMS;

EID: 0028406575     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(05)80005-4     Document Type: Article

References (23)

1. D. Angluin, Queries and concept learning, Mach. Learning 2 (1988), 319-342.
2. D. Angluin and P. Laird, Learning from noisy examples, Mach. Learning 2 (1988), 343-370.
3. D. Angluin and C. H. Smith, Inductive inference: Theory and methods, Comput. Surveys 15, No. 3 (1983).
4. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18 (1979), 155-193.
5. S. Ben-David and G. M. Benedek, “Measurability Constraints on PAC Learnability,” Tech. Rep. Department of Computer Science, Technion, Haifa, 1992.
6. S. Ben-David, G. M. Benedek, and Y. Mansour, Parameterization scheme for classifying models of learnability, to appear in Inform, and Comput. 108 (1994).
7. G. M. Benedek and A. Itai, Learnability by fixed distributions, Theoret. Comput. Sci. 88 (1991), 377-389; preliminary version appeared in “COLT’88,” (1988).
8. G. M. Benedek and A. Itai, Nonuniform learnability, in “15th International Colloquium on Automata, Languages and Programming, (ICALP), Tampere, Finland, 1988,” Lecture Notes in Computer Science, Vol. 317 (T. Lepisto and A. Salomaa, Eds.), Springer-Verlag, New York/Berlin, 1988.
9. A. Blumer, A. Ehrenfeucht, D. Haussler and M. Warmuth, Learnability and the Vapnik- Chervonenkis dimension, J. Assoc. Comput. Mach. 36, No. 4 (1989), 929-965.
10. A Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth, Occam’s razor, Inform. Process. Lett. 24 (1987), 377-380.
11. A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant, A general lower bound on the number of examples needed for learning, in “COLT’88,” (1988).
12. P. R. Halmos, “Measure Theory,” Van Nostrand, New York, 1950.
13. D. Haussler, M. Kearns, N. Littlestone, and M. Warmuth, Equivalence of models for polynomial learnability, in “COLT’88,” (1988).
14. J. E. Hopcroft and J. D. Ullman, “Introduction to Automata Theory, Languages and Computation,” Addison-Wesley, Reading, MA, 1979.
15. M. Kearns, L. Ming, L. Pitt, and L. G. Valiant, On the learnability of Boolean formulae, in “Proceedings, 19th Symp. Theory of Comput.,” pp. 285-295, Assoc. Comput. Mach., New York, 1987.
16. N. Lineal, Y. Mansour, and R. Rivest, Results on learnability and the Vapnik-Chervonenkis dimension, in “Proceedings, 29th FOCS,” pp. 120-129, (1988).
17. B. K. Natarajan, On learning Boolean functions, in “Proceedings, 19th Symp. Theory of Comput.,” pp. 296-304, Assoc Comput. Mach., New York, 1987.
18. L. Pitt and L. G. Valiant, “Computational Limitations on Learning from Examples,” Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138, July 1986.
19. S. Shelah, unpublished manuscript.
20. V. N. Vapnik and A. Ya Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16, No. 2 (1971), 264-280.
21. L. G. Valiant, A theory of the learnable, Comm. ACM 21, No. 11 (1984), 1134-1142.
22. L. G. Valiant, Learning disjunctions of conjunctions, in “Proceedings, 9th IJCAI, Los Angeles, CA, August 1985,” Vol. 1, pp. 560-566.
23. L. G. Valiant, Deductive learning, Aiken Computational Laboratory, Harvard University, 1984.