Agnostically learning halfspaces

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 11-20

  Kalai, Adam Tauman ^a   Klivans, Adam R ^b   Mansour, Yishay ^c   Servedio, Rocco A ^d  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADVERSARIAL NOISE; AGNOSTIC FRAMEWORK; HALFSPACES; NOISE TOLERANT ARBITRARY DISTRIBUTION;

ACOUSTIC VARIABLES CONTROL; BIT ERROR RATE; BOOLEAN FUNCTIONS; DISTRIBUTED COMPUTER SYSTEMS; FOURIER TRANSFORMS; POLYNOMIAL APPROXIMATION; REGRESSION ANALYSIS;

LEARNING SYSTEMS;

EID: 33746082261     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.13     Document Type: Conference Paper

References (31)

1. E. Baum. The Perceptron algorithm is fast for nonmalicious distributions. Neural Computation, 2:248-260, 1990.
2. E. B. Baum and Y.-D. Lyuu. The transition to perfect generalization in perceptions. Neural Computation, 3:386-401, 1991.
3. A. Blum. Machine learning: a tour through some favorite results, directions, and open problems. FOCS 2003 tutorial slides, available at http://www-2.cs.cmu.edu/~avrim/Talks/FOCS03/tutorial.ppt, 2003.
4. A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial time algorithm for learning noisy linear threshold functions. Algorithmica, 22(1/2):35-52, 1997.
5. S. Bonan and D. Clark. Estimates of the hermite and the freud polynomials. Journal of Approximation Theory, 63:210-224, 1990.
6. N. Bshouty and C. Tamon. On the Fourier spectrum of monotone functions. Journal of the ACM, 43(4):747-770, 1996.
7. 1 regression. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 257-266, 2005.
8. S. Decatur. Statistical queries and faulty PAC oracles. In Proceedings of the Sixth Workshop on Computational Learning Theory, pages 262-268, 1993.
9. Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
10. S. Goldman, M. Kearns, and R. Schapire. On the Sample Complexity of Weakly Learning. Information and Computation, 117(2):276-287, 1995.
11. J. Jackson. The Harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice. PhD thesis, Carnegie Mellon University, August 1995.
12. 0. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
13. A. Kalai, A. Klivans, Y. Mansour, and R. Servedio. Agnostically learning halfspaces. Technical Report CUCS-030-05, Columbia University, 2005.
14. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998.
15. M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807-837, 1993.
16. M. Kearns, R. Schapire, and L. Sellie. Toward Efficient Agnostic Learning. Machine Learning, 17(2/3):115-141, 1994.
17. A. Klivans, R. O'Donnell, and R. Servedio. Learning intersections and thresholds of halfspaces. Journal of Computer & System Sciences, 68(4):808-840, 2004.
18. W. Lee, P. Bartlett, and R. Williamson. Efficient agnostic learning of neural networks with bounded fan-in. IEEE Transactions on Information Theory, 42(6):2118-2132, 1996.
19. W. S. Lee, P. L. Bartlett, and R. C. Williamson. On efficient agnostic learning of linear combinations of basis functions. In Proceedings of the Eighth Annual Conference on Computational Learning Theory, pages 369-376, Santa Cruz, California, 5-8 July 1995. ACM Press.
20. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform and learnability. Journal of the ACM, 40(3):607-620, 1993.
21. P. Long. On the sample complexity of PAC learning half-spaces against the uniform distribution. IEEE Transactions on Neural Networks, 6(6):1556-1559, 1995.
22. P. Long. An upper bound on the sample complexity of pac learning halfspaces with respect to the uniform distribution. Information Processing Letters, 87(5):229-234, 2003.
23. Y. Mansour and M. Parnas. Learning conjunctions with noise under product distributions. Information Processing Letters, 68(4):189-196, 1998.
24. N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials. In Proceedings of the 24th Annual Symposium on Theory of Computing, pages 462-467, 1992.
25. R. O'Donnell and R. Servedio. New degree bounds for polynomial threshold functions. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 325-334, 2003.
26. R. Paturi. On the degree of polynomials that approximate symmetric Boolean functions. In Proceedings of the 24th Symposium on Theory of Computing, pages 468-474, 1992.
27. 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.
28. G. Szegö. Orthogonal Polynomials, volume XXIII of Americam Mathematical Society Colloquium Publications. A.M.S, Providence, 1989.
29. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
30. L. Valiant. Learning disjunctions of conjunctions. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 560-566, 1985.
31. V. Vapnik. Statistical Learning Theory. Wiley-Interscience, New York, 1998.