Hardness of learning halfspaces with noise

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

Volumn , Issue , 2006, Pages 543-552

  Guruswami, Venkatesan ^a   Raghavendra, Prasad ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROBLEM; LEARNING HALFSPACES; RANDOM CLASSIFICATION NOISE;

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PROBLEM SOLVING;

LEARNING SYSTEMS;

EID: 35448964255     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.33     Document Type: Conference Paper

References (21)

1. S. Agmon. The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6(3):382-392, 1954.
2. N. Alon and J. Spencer. The Probabilistic Method. John Wiley and Sons, Inc., 1992.
3. E. Amaldi and V. Kann. On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoretical Computer Science, 109:237-260, 1998.
4. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. Journal of Computer System Sciences, 54(2):317-331, 1997.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
6. S. Ben-David, N. Eiron, and P. M. Long. On the difficulty of approximately maximizing agreements. In Proceedings of the 13th COLT, pages 266-274, 1992.
7. A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial-time algorithm for learning noisy linear threshold functions. In Proceedings of the 37th IEEE Symposium on the Foundations of Computer Science, 1996.
8. E. Cohen. Learning noisy perceptrons by a perceptron in polynomial time. In Proceedings of the 38th IEEE Symposium on the Foundations of Computer Science, pages 514-523, 1997.
9. U. Feige and D. Reichman. On the hardness of approximating Max-Satisfy. Electronic Colloquium on Computational Complexity (ECCC), TR04-119, 2004.
10. V. Feldman. Optimal hardness results for maximizing agreements with monomials. Electronic Colloquium on Computational Complexity, TR06-032, 2006. To appear in 21st Annual IEEE Computational Complexity Conference (CCC), 2006.
11. V. Feldman, P. Gopalan, S. Khot, and A. K. Ponnuswami. New results for learning noisy parities and halfspaces. ECCC Technical Report TR06-059, 2006.
12. M. Halldorsson. Approximations of weighted indpendent set and hereditary subset problems. J. Gaph Algorithms Appl., 4(1), 2000.
13. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
14. A. Kalai, A. Klivans, Y. Mansour, and R. Servedio. Agnostically learning halfspaces. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pages 11-20, 2005.
15. E. Kaplan, M. Naor, and O. Reingold. Derandomized constructions of k-wise (almost) independent permutations. In Proceedings of the 9th Workshop on Randomization and Computation (RANDOM), pages 354-365, 2005.
16. M. Kearns, R. Schapire, and L. Sellie. Toward efficient agnostic learning. Machine Learning, 17:115-141, 1994.
17. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1987.
18. M. Minsky and S. Papert. Perceptrons: An Introduction to Computational Learning Theory. The MIT Press, 1969.
19. M. Naor and O. Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. Cryptology, 12(1):29-66, 1999.
20. R. Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803, 1998.
21. U. Zwick. Finding almost satisfying assignments. In Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), pages 551-560, May 1998.