On learning monotone DNF under product distributions

Information and Computation

Volumn 193, Issue 1, 2004, Pages 57-74

  Servedio, Rocco A ^a  

^a Columbia University ^*  (United States)

Author keywords

Computational learning theory; DNF formula; Monotone Boolean function; PAC learning

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS;

COMPUTATIONAL LEARNING THEORY; MONOTONE BOOLEAN FUNCTIONS; MONOTONE FUNCTIONS; PAC LEARNING;

INFORMATION SCIENCE;

EID: 3142730058     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.04.003     Document Type: Article

References (27)

1. Ajtai M., Gurevich Y. Monotone versus positive. J. ACM. 34(4):1987;1004-1015.
2. Angluin D. Queries and concept learning. Mach. Learn. 2(4):1988;319-342.
3. P. Beame, A switching lemma primer, Tech. Report UW-CSE-95-07-01, University of Washington, November 1994.
4. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, S. Rudich, Weakly learning DNF and characterizing statistical query learning using Fourier analysis, in: Proc. 26th Ann. Symp. on Theory of Computing, 1994, pp. 253-262.
5. Bahadur R. A representation of the joint distribution of responses to n dichotomous items. Solomon H. Studies in Item Analysis and Prediction. 1961;158-168 Stanford University Press.
6. M. Bellare, A technique for upper bounding the spectral norm with applications to learning, in: Proc. Fifth Ann. Workshop on Comp. Learning Theory, 1992, pp. 62-70.
7. Boppana R., Sipser M. The complexity of finite functions. Handbook of Theoretical Computer Science. vol. A:1990;MIT Press.
8. Bshouty N. Exact learning Boolean functions via the monotone theory. Inf. Comput. 123(1):1995;146-153.
9. N. Bshouty, J. Jackson, C. Tamon, More efficient PAC-learning of DNF with membership queries under the uniform distribution, in: Proc. 12th Ann. Conf. on Comp. Learning Theory, 1999, pp. 286-295.
10. Bshouty N., Tamon C. On the Fourier spectrum of monotone functions. J. ACM. 43(4):1996;747-770.
11. 0 functions, in: Proc. Fourth Ann. Workshop on Comp. Learning Theory, 1991, pp. 317-325.
12. Hagerup T., Rub C. A guided tour to Chernoff bounds. Inf. Proc. Lett. 33:1989;305-308.
13. T. Hancock, Y. Mansour, Learning monotone k-μ DNF formulas on product distributions, in: Proc. 4th Ann. Workshop on Comp. Learning Theory, 1991, pp. 179-183.
14. J. Håstad, Computational limitations for small depth circuits, Ph.D. thesis, MIT Press, 1986.
15. Jackson J. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J. Comput. Syst. Sci. 55:1997;414-440.
16. J. Kahn, G. Kalai, N. Linial, The influence of variables on Boolean functions, in: Proc. 29th Ann. Symp. on Found. of Comp. Sci., 1988, pp. 68-80.
17. M. Kearns, M. Li, L. Pitt, L. Valiant, On the learnability of Boolean formulae, in: Proc. 19th Ann. ACM Symp. on Theory of Computing, 1987, pp. 285-295.
18. Kearns M., Li M., Valiant L. Learning boolean formulas. J. ACM. 41(6):1994;1298-1328.
19. Khardon R. On using the Fourier transform to learn disjoint DNF. Inf. Process. Lett. 49:1994;219-222.
20. A. Klivans, R. Servedio, Boosting and hard-core sets, in: Proc. 40th Ann. Symp. on Found. of Comp. Sci., 1999, pp. 624-633.
21. Linial N., Mansour Y., Nisan N. Constant depth circuits, Fourier transform and learnability. J. ACM. 40(3):1993;607-620.
22. log logn) learning algorithm for DNF under the uniform distribution J. Comput. Syst. Sci. 50:1995;543-550.
23. Okol'nishnikova E. On the influence of negations on the complexity of a realization of monotone Boolean functions by formulas of bounded depth. Metody Diskret. Analiz. 38:1982;74-80. in Russian.
24. Sakai Y., Maruoka A. Learning monotone log-term DNF formulas under the uniform distribution. Theory Comput. Syst. 33:2000;17-33. A preliminary version appeared in: Proc. Seventh Conf. on Comp. Learning Theory, 1994, pp. 165-172.
25. Sakai Y., Maruoka A. Learning monotone log-term DNF formulas under the uniform distribution. Theory Comput. Syst. 33:2000;17-33. A preliminary version appeared in: Proc. Seventh Conf. on Comp. Learning Theory, 1994, pp. 165-172.
26. Valiant L.G. A theory of the learnable. Comm. ACM. 27(11):1984;1134-1142.
27. K. Verbeurgt, Learning DNF under the uniform distribution in quasi-polynomial time, in: Proc. 3rd Ann. Workshop on Comp. Learning Theory, 1990, pp. 314-326.