On the efficiency of noise-tolerant PAC algorithms derived from statistical queries

Annals of Mathematics and Artificial Intelligence

Volumn 39, Issue 3, 2003, Pages 291-313

  Jackson, Jeffrey ^a  

^a DUQUESNE UNIVERSITY   (United States)

Author keywords

Fourier analysis; PAC learning; Statistical Query model

Indexed keywords

EID: 0038505858     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024697502780     Document Type: Article

References (22)

1. J.A. Aslam and S.E. Decatur, Specification and simulation of statistical query algorithms for efficiency and noise tolerance, Journal of Computer and System Sciences 56(2) (1998) 191-208.
2. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour and S. Rudich, Weakly learning DNF and characterizing statistical query learning using Fourier analysis, in: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (1994) pp. 253-262. Preliminary version available as http://www.mathcs.duq.edu/~jackson/dnfsq.ps.
3. A. Blum, A. Kalai and H. Wasserman, Noise-tolerant learning, the parity problem, and the Statistical Query model, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000) pp. 435-440.
4. B. Bollobás, Random Graphs (Academic Press, 1985).
5. N. Bshouty and C. Tamon, On the Fourier spectrum of monotone functions, Journal of the ACM 43(4) (1996) 747-770.
6. Y. Freund and R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and Systems Sciences 55(1) (1997) 119-139. First appeared in EuroCOLT'95.
7. Y. Freund and R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and Systems Sciences 55(1) (1997) 119-139. First appeared in EuroCOLT'95.
8. O. Goldreich and L.A. Levin, A hard-core predicate for all one-way functions, in: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (1989) pp. 25-32.
9. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds, Information Processing Letters 33 (1989/90) 305-308.
10. W. Hoeffding, Probability inequalities for sums of bounded random variables, American Statistical Association Journal 58 (1963) 13-30.
11. J. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, Journal of Computer and System Sciences 55(3) (1997) 414-440. Earlier version appeared in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994) pp. 42-53. Preliminary extended version available as http://www.mathcs.duq.edu/~jackson/J97.ps.
12. J. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, Journal of Computer and System Sciences 55(3) (1997) 414-440. Earlier version appeared in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994) pp. 42-53. Preliminary extended version available as http://www.mathcs.duq.edu/~jackson/J97.ps.
13. M.J. Kearns, Efficient noise-tolerant learning from statistical queries, Journal of the ACM 45(6) (1998) 983-1006. Earlier version appeared in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993) pp. 392-401.
14. M.J. Kearns, Efficient noise-tolerant learning from statistical queries, Journal of the ACM 45(6) (1998) 983-1006. Earlier version appeared in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993) pp. 392-401.
15. E. Kushilevitz and Y. Mansour, Learning decision trees using the Fourier spectrum, SIAM Journal on Computing 22(6) (December 1993) 1331-1348. Earlier version appeared in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (1991) pp. 455-464.
16. E. Kushilevitz and Y. Mansour, Learning decision trees using the Fourier spectrum, SIAM Journal on Computing 22(6) (December 1993) 1331-1348. Earlier version appeared in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (1991) pp. 455-464.
17. N. Linial, Y. Mansour and N. Nisan, Constant depth circuits, Fourier transform, and learnability, Journal of the ACM 40(3) (1993) 607-620. Earlier version appeared in Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989) pp. 574-579.
18. N. Linial, Y. Mansour and N. Nisan, Constant depth circuits, Fourier transform, and learnability, Journal of the ACM 40(3) (1993) 607-620. Earlier version appeared in Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989) pp. 574-579.
19. J.E. Littlewood, On the probability in the tail of a binomial distribution, Advances in Applied Probability 1 (1969) 43-72.
20. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes (Elsevier Science Publishers, 1977).
21. R.E. Schapire, The strength of weak learnability, Machine Learning 5 (1990) 197-227.
22. L.G. Valiant, A theory of the learnable, Communications of the ACM 27(11) (1984) 1134-1142.