Learning functions of k relevant variables

Journal of Computer and System Sciences

Volumn 69, Issue 3 SPEC. ISS., 2004, Pages 421-434

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

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Columbia University ^*  (United States)

^d HARVARD UNIVERSITY   (United States)

Author keywords

Boolean functions; Computational learning theory; PAC learning

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DECISION THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; STATISTICAL METHODS;

BOOLEAN VARIABLES; COMPUTATIONAL LEARNING THEORY; DECISION TREE; PAC LEARNING;

LEARNING SYSTEMS;

EID: 4544337873     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.04.002     Document Type: Conference Paper

References (25)

1. Bernasconi A. On a hierarchy of Boolean functions hard to compute in constant depth. Discrete Math. Theoret. Comput. Sci. 4(2):2001;279-290.
2. A. Blum, Relevant examples and relevant features: thoughts from computational learning theory, in: AAAI Fall Symposium on 'Relevance', 1994, pp. 18-22.
3. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, S. Rudich, Weakly learning DNF and characterizing statistical query learning using Fourier analysis, in: Proceedings of the 26th Anniversary Symposium on Theory of Computing, 1994, pp. 253-262.
4. Blum A., Langley P. Selection of relevant features and examples in machine learning. Artif. Intell. 97(1-2):1997;245-271.
5. Blumer A., Ehrenfeucht A., Haussler D., Warmuth M. Occam's razor. Inform. Process. Lett. 24:1987;377-380.
6. Bshouty N., Feldman V. On using extended statistical queries to avoid membership queries. J. Mach. Learn. Res. 2:2002;359-395.
7. N. Bshouty, J. Jackson, C. Tamon, More efficient PAC learning of DNF with membership queries under the uniform distribution, in: Proceedings of the 12th Annual Conference on Computational Learning Theory, 1999, pp. 286-295.
8. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, in: Proceedings of the 19th Symposium on Theory of Computing, 1987, pp. 1-6.
9. E. Fischer, G. Kindler, D. Ron, S. Safra, A. Samorodnitsky, Testing juntas, in: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, 2002, pp. 103-112.
10. Helmbold D., Sloan R., Warmuth M. Learning integer lattices. SIAM J. Comput. 21(2):1992;240-266.
11. Jackson J. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J. Comput. System Sci. 55:1997;414-440.
12. 0, in: Proceedings of the 34th ACM Symposium on Theory of Computing, 2002, pp. 776-784.
13. A. Kalai, Y. Mansour, Personal communication, 2001.
14. Kearns M. Efficient noise-tolerant learning from statistical queries. J. Assoc. Comput. Mach. 45(6):1998;983-1006.
15. Kucera L., Marchetti-Spaccamela A., Protassi M. On learning monotone DNF formulae under uniform distributions. Inform. Comput. 110:1994;84-95.
16. Linial N., Mansour Y., Nisan N. Constant depth circuits Fourier transform and learnability. J. Assoc. Comput. Mach. 40(3):1993;607-620.
17. Y. Mansour, Learning Boolean functions via the Fourier transform, in: V.P. Roychodhury, K.Y. Siu, A. Orlitsky (Eds.), Theoretical Advance in Neural Computational and Learning, 1994, pp. 391-424.
18. log log n) learning algorithm for DNF under the uniform distribution J. Comput. System Sci. 50:1995;543-550.
19. Y. Mansour, Personal communication, 2001.
20. O. Regev, Personal communication, 2003.
21. S. Rudich, Problem set 6 model solutions; available at http://www-2.cs.cmu.edu/~rudich/complexity/handouts/Probsets/Probset6/ .
22. Valiant L. A theory of the learnable. Commun. Assoc. Comput. Mach. 27(11):1984;1134-1142.
23. K. Verbeurgt, Learning DNF under the uniform distribution in quasi-polynomial time, in: Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990, pp. 314-326.
24. K. Verbeurgt, Learning sub-classes of monotone DNF on the uniform distribution, in: Proceedings of the Ninth Conference on Algorithmic Learning Theory, 1998, pp. 385-399.
25. von zur Gathen J., Roche J. Polynomials with two values. Combinatorica. 17(3):1997;345-362.