Optimal hardness results for maximizing agreements with monomials

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 226-234

  Feldman, Vitaly ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INAPPROXIMABILITY FACTORS; MONOMIALS; OPTIMAL HARDNESS; SYMMETRIC PROBLEMS;

APPROXIMATION ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; OPTIMIZATION;

PROBLEM SOLVING;

EID: 34247535521     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.31     Document Type: Conference Paper

References (22)

1. M. Alekhnovich, M. Braverman, V. Feldman, A. Klivans, and T. Pitassi. Learnability and automizability. In Proceeding of FOCS '04, pages 621-630, 2004.
2. E. Amaldi and V. Kann. The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Science, 147(1&2): 181-210, 1995.
3. D. Angluin and P. Laird. Learning from noisy examples. Machine Learning, 2:343-370, 1988.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
5. S. Ben-David, N. Eiron, and P. M. Long. On the difficulty of approximately maximizing agreements. J. Comput. Syst. Sci., 66(3):496-514, 2003.
6. A. Blum. Lecture notes for 15-859(B) Machine Learning Theory, 2002. Available at http://www.es.cmu.edu/~avrim/ML02/
7. N. Bshouty and L. Burroughs. Bounds for the minimum disagreement problem with applications to learning theory. In Proceedings of COLT '02, pages 271-286, 2002.
8. N. Bshouty and L. Burroughs. Maximizing agreements and coagnostic learning. In Proceedings of ALT '02, pages 83-97, 2002.
9. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
10. M. Goldmann, J. Hastad, and A. Razborov. Majority gates vs. general weighted threshold gates. Computational Complexity, 2:277-300, 1992.
11. J. Hastad. Some optimal inapproximability results. Journal of ACM, 48(4):798-859, 2001.
12. D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
13. K. Hoffgen, H. Simon, and K. Van Horn. Robust trainability of single neurons. Journal of Computer and System Sciences, 50(1):114-125, 1995.
14. A. Tauman Kalai, A. Klivans, Y. Mansour, and R. Servedio. Agnostically learning halfspaces. In FOCS '05, pages 11-20, 2005.
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, M. Li, L. Pitt, and L. Valiant. On the learnability of boolean formulae. In Proceedings of the Nineteenth Annual Symposium on Theory of Computing, pages 285-295, 1987.
17. M. Kearns, R. Schapire, and L. Sellie. Toward efficient agnostic learning. Machine Learning, 17(2-3):115-141, 1994.
18. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41(5):960-981, 1994.
19. L. Pitt and L. Valiant. Computational limitations on learning from examples. Journal of the ACM, 35(4):965-984, 1988.
20. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of STOC '97, pages 475-434, 1997.
21. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
22. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.