Learning juntas

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 206-212

  Mossel, Elchanan ^a   O'Donnell, Ryan ^b   Seryedio, Rocco A ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Fu Foundation School of Engineering and Applied Science   (United States)

Author keywords

Fourier; Juntas; Learning; Relevant variables; Uniform distribution

Indexed keywords

BOOLEAN FUNCTIONS; LEARNING ALGORITHMS; LEARNING SYSTEMS; POLYNOMIALS;

JUNTAS;

COMPUTATION THEORY;

EID: 0038784670     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780572.780574     Document Type: Conference Paper

References (22)

1. N. Bshouty andV. Feldman. On using extended statistical queries to avoid membership queries. Journal of Machine Learning Research, 2:359-395, 2002.
2. A. Bernasconi. On a hierarchy of boolean functions hard to compute in constant depth. Discrete Mathematics & Theoretical Computer Science, 4:2:79-90, 2001.
3. A. Blum. Relevant examples and relevant features: Thoughts from computational learning theory. In AAAI Fall Symposium on 'Relevance', 1994.
4. A. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2):245-271, 1997.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, 1987.
6. N. Bshouty, J. Jackson, and C. Tamon. More efficient PAC learning of DNF with membership queries under the uniform distribution. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, pages 286-295, 1999.
7. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the Nineteenth Symposium on Theory of Computing, pages 1-6, 1987.
8. E. Fischer, G. Kindler, D. Ron, S. Safra, and A. Samorodnitsky. Testing juntas. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, 2002.
9. D. Helmbold, R. Sloan, and M. Warmuth. Learning integer lattices. SIAM Journal on Computing, 21(2):240-266., 1992.
10. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55:414-440, 1997.
11. 0. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
12. A. Kalai and Y. Mansour. Personal communication., 2001.
13. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998.
14. L. Kucera, A. Marchetti-Spaccamela, and M. Protassi. On learning monotone DNF formulae under uniform distributions. Information and Computation, 110:84-95, 1994.
15. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform and learnability. Journal of the ACM, 40(3):607-620, 1993.
16. Y. Mansour. Learning Boolean functions via the Fourier transform, pages 391-424. 1994.
17. loglogn) learning algorithm for DNF under the uniform distribution. Journal of Computer and System Sciences, 50:543-550, 1995.
18. Y. Mansour. Personal communication., 2001.
19. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
20. K. Verbeurgt. Learning DNF under the uniform distribution in quasi-polynomial time. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 314-326, 1990.
21. K. Verbeurgt. Learning sub-classes of monotone DNF on the uniform distribution. In Proceedings of the Ninth Conference on Algorithmic Learning Theory, pages 385-399, 1998.
22. J. von zur Gathen and J. Roche. Polynomials with two values. Combinatorica, 17(3):345-362, 1997.