Noise-tolerant learning, the parity problem, and the statistical query model

Journal of the ACM

Volumn 50, Issue 4, 2003, Pages 506-519

  Blum, Avrim ^a,b   Kalai, Adam ^a,b   Wasserman, Hal ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

Computational learning theory; Machine learning; Statistical queries

Indexed keywords

COMPUTATIONAL LEARNING THEORY; STATISTICAL QUERIES; STATISTICAL QUERY MODEL;

CRYPTOGRAPHY; IMAGE CODING; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES; STATISTICAL MECHANICS;

LEARNING SYSTEMS;

EID: 24144453496     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/792538.792543     Document Type: Article

References (15)

1. AJTAI, M., KUMAR, R., AND SIVAKUMAR, D. 2001. A sieve algorithm for the shortest lattice vector problem. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM, New York.
2. ANGLUIN, D., AND LAIRD, P. 1988. Learning from noisy examples. Mach. Learn. 2, 4, 343-370.
3. ASLAM, J. A., AND DECATUR, S. E. 1998a. General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. Inf. Comput. 141, 2 (Mar.), 85-118.
4. ASLAM, J. A., AND DECATUR, S. E. 1998b. Specification and simulation of statistical query algorithms for efficiency and noise tolerance. J. Comput. Syst. Sci. 56, 2 (Apr.), 191-208.
5. BLUM, A., FURST, M., JACKSON, J., KEARNS, M., MANSOUR, Y., AND RUDICH, S. 1994. Weakly learning DNF and characterizing statistical query learning using fourier analysis. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (May). ACM New York, pp. 253-262.
6. DECATUR, S. E. 1993. Statistical queries and faulty PAC oracles. In Proceedings of the 6th Annual ACM Workshop on Computational Learning Theory. ACM, New York.
7. DECATUR, S. E. 1996. Learning in hybrid noise environments using statistical queries. In Learning from Data: Artificial Intelligence and Statistics V, D. Fisher and H.-J. Lenz, Eds. Springer-Verlag, New York.
8. HELMBOLD, D., SUDAN, R., AND WARMUTH, M. 1992. Learning integer lattices. SIAM J. Comput. 21, 2, 240-266.
9. MACWILLIAMS, F., AND SLOANE, N. 1977. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, The Netherlands.
10. JACKSON, J. 2000. On the efficiency of noise-tolerant PAC algorithms derived from statistical queries. In Proceedings of the 13th Annual Workshop on Computational Learning Theory.
11. KEARNS, M. 1998. Efficient noise-tolerant learning from statistical queries. J. ACM, 45, 6 (Nov.), 983-1006.
12. KUMAR, R., AND SIVAKUMAR, D. 2001. On polynomial approximations to the shortest lattice vector length. In Proceedings of the 12th Annual Symposium on Discrete Algorithms.
13. LITTLESTONE, N. 1988. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn. 2, 285-318.
14. LITTLESTONE, N. 1989. From online to batch learning. In Proceedings of the 2nd Annual ACM Conference on Computational Learning Theory. ACM, New York, pp. 269-284.
15. WAGNER, D. 2002. A generalized birthday problem. In Proceedings in Advances in Cryptology - CRYPTO 2002. Lecture Notes in Computer Science, vol. 2442. Springer-Verlag, New York, pp. 288-304.