Learning intersections and thresholds of halfspaces

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 177-186

  Klivans, Adam R ^a   O'Donnell, Ryan ^a   Servedio, Rocco A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; ERROR ANALYSIS; FOURIER TRANSFORMS; LEARNING SYSTEMS; POLYNOMIALS; PROBABILITY; SENSITIVITY ANALYSIS;

LINEAR THRESHOLD FUNCTIONS; POLYNOMIAL TIME ALGORITHM;

LEARNING ALGORITHMS;

EID: 0036957227     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2002.1181894     Document Type: Conference Paper

References (43)

1. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The expressive power of voting polynomials. Combinatorica, 14(2): 1-14, 1994.
2. E. Baum. Neural net algorithms that learn in polynomial time from examples and queries. IEEE Trans. on Neural Networks, 2:5-19, 1991.
3. E. Baum. A polynomial time algorithm that learns two hidden unit nets. Neural Computation, 2:510-522, 1991.
4. R. Beigel, N. Reingold, and D. Spielman. Pp is closed under intersection. Journal of Computer and System Sciences, 50(2):191-202, 1995.
5. M. Bellare. A technique for upper bounding the spectral norm with applications to learning. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pages 62-70, 1992.
6. I. Benjamini, G. Kalai, and O. Schramm. Noise sensitivity of boolean functions and applications to percolation. Inst. Hautes Études Sci. Publ. Math., 90:5-43, 1999.
7. H. Block. The perceptron: a model for brain functioning. Reviews of Modern Physics, 34:123-135, 1962.
8. A. Blum, P. Chalasani, S. A. Goldman, and D. K. Slonim. Learning with unreliable boundary queries. Journal of Computer and System Sciences, 56(2):209-222, 1998.
9. 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 Twenty-Sixth Annual Symposium on Theory of Computing, pages 253-262, 1994.
10. A. Blum and R. Kannan. Learning an intersection of a constant number of halfspaces under a uniform distribution. Journal of Computer and System Sciences, 54(2):371-380, 1997.
11. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and the vapnik-chervonenkis dimension. Journal of the ACM, 36(4):929-965, 1989.
12. D. Boneh and R. Lipton. Amplification of weak learning over the uniform distribution. In Proceedings of the Sixth Annual Workshop on Computational Learning Theory, pages 347-351, 1993.
13. 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.
14. N. Bshouty and C. Tamon. On the fourier spectrum of monotone functions. Journal of the ACM, 43(4):747-770, 1996.
15. M. Golea, M. Marchand, and T. Hancock. On learning μ-perceptron networks on the uniform distribution. Neural Networks, 9:67-82, 1994.
16. A. Hajnal, W. Maass, P. Pudlak, M. Szegedy, and G. Turan. Threshold circuits of bounded depth. Journal of Computer and System Sciences, 46:129-154, 1993.
17. T. Hancock. The complexity of learning formulas and decision trees that have restricted reads. PhD thesis, Harvard University, 1992.
18. T. Hancock and Y. Mansour. Learning monotone k-μ dnf formulas on product distributions. In Proceedings of the Fourth Annual Conference on Computational Learning Theory, pages 179-193, 1991.
19. 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.
20. 0. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
21. R. Khardon. On using the fourier transform to learn disjoint dnf. Information Processing Letters, 49:219-222, 1994.
22. M. Kharitonov. Cryptographic hardness of distribution-specific learning. In Proceedings of the Twenty-Fifth Annual Symposium on Theory of Computing, pages 372-381, 1993.
23. A. Klivans and R. Servedio. Boosting and hard-core sets. In Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science, pages 624-633, 1999.
24. õ(n1/3). In Proceedings of the Thirty-Third Annual Symposium on Theory of Computing, pages 258-265, 2001.
25. S. Kwek and L. Pitt. Pac learning intersections of halfspaces with membership queries. Algorithmica, 22(1/2):53-75, 1998.
26. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, fourier transform and learnability. Journal of the ACM, 40(3):607-620, 1993.
27. W. Maass and G. Turan. How fast can a threshold gate learn?, pages 381-414, MIT Press, 1994.
28. Y. Mansour. Learning Boolean functions via the Fourier transform, pages 391-424, 1994.
29. log log n) learning algorithm for dnf under the uniform distribution. Journal of Computer and System Sciences, 50:543-550, 1995.
30. M. Minsky and S. Papert. Perceptrons: an introduction to computational geometry. MIT Press, Cambridge, MA, 1968.
31. D. J. Newman. Rational approximation to |x|. Michigan Mathematical Journal, 11:11-14, 1964.
32. N. Nisan and M. Szegedy. On the degree of boolean functions as real polynomials. In Proceedings of the Twenty-Fourth Annual Symposium on Theory of Computing, pages 462-467, 1992.
33. R. O'Donnell. Hardness amplification within np. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
34. Y. Peres. personal communication, 2001.
35. F. Rosenblatt. The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review, 65:386-407, 1958.
36. Y. Sakai and A. Maruoka. Learning monotone log-term dnf formulas under the uniform distribution. Theory of Computing Systems, 33:17-33, 2000.
37. R. Servedio. On pac learning using winnow, perceptron, and a perceptron-like algorithm. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, pages 296-307, 1999.
38. R. Servedio. On learning monotone dnf under product distributions. In Proceedings of the Fourteenth Annual Conference on Computational Learning Theory, pages 473-489, 2001.
39. K.-Y. Siu, V. Roychowdhury, and T. Kailath. Rational approximation techniques for analysis of neural networks. IEEE Transactions on Information Theory, 40(2):445-474, 1994.
40. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
41. S. Vempala. A random sampling based algorithm for learning the intersection of halfspaces. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 508-513, 1997.
42. 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.
43. 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.