General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting

Information and Computation

Volumn 141, Issue 2, 1998, Pages 85-118

  Aslam, Javed A ^a   Decatur, Scott E ^b  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346398224     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2664     Document Type: Article

References (21)

1. Angluin, D. (1992), Computational learning theory: Survey and selected bibliography, in "Proceedings of the 24th Annual ACM Symposium on the Theory of Computing."
2. Angluin, D., and Laird, P. (1988), Learning from noisy examples, Mach. Learning 2 (4), 343-370.
3. Anthony, M., and Biggs, N. (1992), "Computational Learning Theory," Cambridge Tracts in Theoretical Computer Science, Vol. 30, Cambridge Univ. Press, Cambridge, UK.
4. Aslam, J., and Decatur, S. (1994), "Improved Noise-Tolerant Learning and Generalized Statistical Queries," Technical Report TR-17-94, Harvard University, July.
5. Aslam, J., and Decatur, S. (1995), Specification and simulation of statistical query algorithms for efficiency and noise tolerance, in "Proceedings of the Eighth Annual ACM Workshop on Computational Learning Theory," ACM Press, July. J. Comput. System Sci., to appear.
6. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. K. (1989), Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36 (4), 829-865.
7. Drucker, H., Schapire, R., and Simard, P. (1992), Improving performance in neural networks using a boosting algorithm, in "Advances in Neural Information Processing Systems," Morgan Kaufmann, San Mateo, CA.
8. Feller, W. (1968), "An Introduction to Probability Theory and Its Applications," Vol. 1, third ed., Wiley, New York.
9. Freund, Y. (1990), Boosting a weak learning algorithm by majority, in "Proceedings of the Third Annual Workshop on Computational Learning Theory," pp. 202-216, Morgan Kaufmann, San Mateo, CA.
10. Freund, Y. (1992), An improved boosting algorithm and its implications on learning complexity, in "Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory," pp. 391-398, Assoc. Comput. Mach. Press.
11. Goldman, S. A., Kearns, M. J., and Schapire, R. E. (1990), On the sample complexity of weak learning, in "Proceedings of the Third Annual Workshop on Computational Learning Theory," pp. 217-231, Morgan Kaufmann, San Mateo, CA.
12. Graham, R., Knuth, D., and Patashnik, O. (1994), "Concrete Mathematics: A Foundation for Computer Science," second ed., Addison-Wesley, Reading, MA.
13. Helmbold, D., Sloan, R., and Warmuth, M. K. (1992), Learning integer lattices, SIAM J. Comput. 21 (2), 240-266.
14. Kearns, M. (1993), Efficient noise-tolerant learning from statistical queries, in "Proceedings of the 25th Annual ACM Symposium on the Theory of Computing," pp. 392-401, San Diego.
15. Laird, P. D. (1988), "Learning from Good and Bad Data," Kluwer international series in engineering and computer science, Kluwer Academic, Boston.
16. Sakakibara, Y. (1991), "Algorithmic Learning of Formal Languages and Decision Trees," Ph.D. thesis, Tokyo Institute of Technology, Oct. International Institute for Advanced Study of Social Information Science, Fujitsu Laboratories Ltd, Research Report IIAS-RR-91-22E.
17. Sauer, N. (1972), On the density of families of sets, J. Combin. Theory Ser. A 13, 145-147.
18. Schapire, R. (1990), The strength of weak learnability, Mach. Learning 5 (2), 197-226.
19. Schapire, R. E. (1992), "The Design and Analysis of Efficient Learning Algorithms," MIT Press, Cambridge, MA.
20. Valiant, L. (1984), A theory of the learnable, Comm. ACM 21 (11), 1134-1142.
21. Vapnik, V. N., and Chervonenkis, A. Ya. (1971), On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (2), 264-280.