Learning with Restricted Focus of Attention

Journal of Computer and System Sciences

Volumn 56, Issue 3, 1998, Pages 277-298

  Ben David, Shai ^a   Dichterman, Eli ^b,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; LEARNING ALGORITHMS; MATHEMATICAL MODELS;

EUCLIDEAN SPACE; NOISE-TOLERANT ALGORITHMS; RESTRICTED FOCUS OF ATTENTION (RFA);

LEARNING SYSTEMS;

EID: 0032091843     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1569     Document Type: Article

References (30)

1. Summary of the panel discussion, in "Proceedings, 1st Annual Workshop on Computer Learning Theory," pp. 398-401, 1988.
2. D. Angluin and P. Laird, Learning from noisy examples, Mach. Learning 2 (1988), 343-370.
3. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for hamiltonian circuits and matchings, J. Comput. System Sci. 18 (1979), 155-193.
4. J. A. Aslam and S. E. Decatur, General bounds on statistical query learning and PAC learning with noise via hypothesis boosting, in "Proceedings, 34th Annual IEEE Symposium Found, of Computer Science," pp. 282-291, IEEE Computer Society Press, Los Alamitos, CA, 1993.
5. S. Ben-David and E. Dichterman, Learning with restricted focus of attention, in "Proceedings, 6th Annual Conference on Computer Learning Theory," pp. 287-296, Assoc. Comput. Mach., New York, 1993.
6. S. Ben-David and E. Dichterman, Learnability with restricted focus of attention guarantees noise-tolerance, in "Proceedings, 5th International Workshop on Algorithmic Learning Theory," pp. 248-259, Springer-Verlag, Berlin/New York, 1994.
7. S. Ben-David, A. Itai, and E. Kushilevitz, Learning by distances, Inform. Comput. 117 (1995), 240-250.
8. S. Ben-David, B. Chor, O. Goldreich, and M. Luby, On the theory of average case complexity, J. Comput. System Sci. 44 (1992), 193-219.
9. A. Birkendorf, E. Dichterman, J. Jackson, N. Klasner, and H. U. Simon, On restricted-focus-of-attention learnability of Boolean functions, in "Proceedings 28th Annual ACM Symposium Theory Comput.," pp. 205-216, Assoc. Comput. Mach., New York, 1996.
10. A. Blum and P. Chalasani, Learning switching concepts, in "Proceedings, 5th Annual Workshop on Computer Learning Theory," pp. 231-242, Assoc. Comput. Mach., New York, 1992.
11. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36 (1989), 929-965.
12. N. Cesa-Bianchi, E. Dichterman, P. Fischer, and H. U. Simon, Noise-tolerant learning near the information-theoretic bound, in "Proceedings 28th Annual ACM Symposium Theory Comput.," pp. 141-150, 1996.
13. E. Decatur and R. Gennaro, On learning from noisy and incomplete examples, in "Proceedings, 8th Annual Conference on Computer Learning Theory," pp. 353-360, Assoc. Comput. Mach., New York, 1995.
14. D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth, Equivalence of models for polynomial learnability, Inform. Comput. 95 (1991), 129-161.
15. D. Helmbold, R. Sloan, and M. K. Warmuth, Learning integer lattices, SIAM J. Comput. 21 (1992), 240-266.
16. M. Kearns, Efficient noise-tolerant learning from statistical queries, in "Proceedings, 25th Annual ACM Symposium Theory Comput.," pp. 392-401, Assoc. Comput. Mach., New York, 1993.
17. M. Kearns and M. Li, Learning in the presence of malicious errors, SIAM J. Comput. 22 (1993), 807-837.
18. M. Kearns, M. Li, and L. Valiant, Learning boolean formulae, Assoc. Comput. Mach. 41 (1995), 1298-1328.
19. M. J. Kearns and R. E. Schapire, Efficient distribution-free learning of probabilistic concepts, J. Comput. System Sci. 48 (1994).
20. M. J. Kearns, R. E. Schapire, and L. M. Sellie, Toward efficient agnostic learning, Mach. Learning 17 (1994), 115-142.
21. P. D. Laird, Learning from good and bad data, in "Kluwer International Series in Engineering and Computer Science," Kluwer, Boston, 1988.
22. N. Linial, Y. Mansour, and N. Nisan, Constant depth circuits, Fourier transform, and learnability, J. Assoc. Comput. Mach. 40 (1993), 607-620.
23. R. L. Rivest, Learning decision lists, Mach. Learning 2 (1987), 229-246.
24. Y. Sakakibara, Noise-tolerant occam algorithms and their applications to learning decision trees, Mach. Learning 11 (1993), 37-62.
25. R. E. Schapire, Learning probabilistic read-once formulas on product distributions, Mach. Learning 14 (1994), 47-81.
26. E. Shamir and C. Schwartzman, Learning by extended statistical queries and its relation to PAC learning, in "Computational Learning Theory: Eurocolt'95," pp. 357-366, Springer-Verlag, Berlin/New York, 1995.
27. R. H. Sloan, Corrigendum to types of noise in data for concept learning, in "Proceedings, 5th Annual Workshop on Computer Learning Theory," pp. 450, Assoc. Comput. Mach., New York, 1992.
28. R. H. Sloan, Four types of noise in data for PAC learning, Inform. Process. Lett. 54 (1995), 157-162.
29. L. G. Valiant, A theory of the learnable, Comm. Assoc. Comput. Mach. 27 (1984), 1134-1142.
30. V. N. Vapnik and A. Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264-280.