Learnability and automatizability

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

Volumn , Issue , 2004, Pages 621-630

  Alekhnovich, Misha ^a   Braverman, Mark ^b   Feldman, Vitaly ^c   Klivans, Adam R ^d   Pitassi, Toniann ^a,b  

^a IAS   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c HARVARD UNIVERSITY   (United States)

^d TOYOTA TECHNOLOGICAL INSTITUTE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIZABILITY; HALFSPACES; LOWER BOUNDS; PSEUDORANDOM FUNCTIONS;

ALGORITHMS; DECISION MAKING; GRAPH THEORY; LEARNING SYSTEMS; POLYNOMIALS; TREES (MATHEMATICS);

COMPUTATIONAL COMPLEXITY;

EID: 17744398476     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. M. Aleknovich and A. Razborov. Resolution is not automatizable unless w[p] is tractable. In IEEE Symposium on Foundations of Computer Science, 2001.
2. M. Alekhnovich, T. Pitassi, and S. Khot. Inapproximability of Fixed Parameter problems. Manuscript, 2004
3. Peter L. Bartlett and Shai Ben-David. Hardness results for neural network approximation problems. Theoretical Computer Science, 284(1):53-66, June 2002.
4. P. Beame, R. Karp, T. Pitassi, and M. Saks. On the complexity of unsatisfiability of random k-CNF formulas. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 561-571, Dallas, TX, May 1998.
5. E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 517-526, Atlanta, GA, May 1999.
6. A. L. Blum and R. L. Rivest. Training a 3-node neural network is NP-complete. Neural Networks, 5(1):117-127, 1992.
7. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, 1987.
8. M. Bonet, T. Pitassi, and R. Raz. Lower bounds for cutting planes proofs with small coefficients. Journal of Symbolic Logic, 62(3):708-728, September 1997.
9. N. Bshouty. A subexponential exact learning algorithm for DNF using equivalence queries. Information Processing Letters, 59:37-39, 1996.
10. M. Clegg, J. Edmonds, and R. Impagliazzo. Using the Gröbner basis algorithm to find proofs of unsatisfiability. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pages 174-183, Philadelphia, PA, May 1996.
11. Irit Dinur, Oded Regev, and Clifford D. Smyth. The hardness of 3-Uniform hypergraph coloring. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS-02), pages 33-42, Los Alamitos, November 16-19 2002. IEEE COMPUTER SOCIETY.
12. R. Downey and M. Fellows. Parameterized complexity. 1998.
13. A. Ehrenfeucht and D. Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231-246, 1989.
14. U. Feige. Randomized graph products, chromatic numbers, and the Lovász θ-function. In stoc95, pages 635-640, 1995.
15. U. Feige and J. Kilian. Zero knowledge and the chromatic number. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity (CCC-96), pages 278-289, Los Alamitos, May 24-27 1996. IEEE Computer Society.
16. U. Feige and J. Kilian. On limited versus polynomial non-determinism. Chicago Journal of Theoretical Computer Science, 1997.
17. E. A. Gold. Complexity of automaton identification from given data. Information and Control, 37:302-320, 1978.
18. V. Guruswami, J. Hastad, and M. Sudan. Hardness of approximate hypergraph coloring. In IEEE, editor, 41st Annual Symposium on Foundations of Computer Science: proceedings: 12-14 November, 2000, Redondo Beach, California, pages 149-158, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 2000. IEEE Computer Society Press.
19. Thomas R. Hancock, Tao Jiang, Ming Li, and John Tromp. Lower bounds on learning decision lists and trees (extended abstract). In 12th Annual Symposium on Theoretical Aspects of Computer Science, volume 900 of lncs, pages 527-538, Munich, Germany, 2-4 March 1995. Springer.
20. Lisa Hellerstein and Vijay Raghavan. Exact learning of DNF formulas using DNF hypotheses. In ACM, editor, Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, May 19-21, 2002, pages 465-473, New York, NY, USA, 2002. ACM Press.
21. 0. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
22. 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.
23. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM, 41(1):67-95, 1994.
24. M. Kharitonov. Cryptographic hardness of distribution-specific learning. In Proceedings of the Twenty-Fifth Annual Symposium on Theory of Computing, pages 372-381, 1993.
25. Subhash Khot. Hardness results for coloring 3-Colorable 3-Uniform hypergraphs. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS-02), pages 23-32, Los Alamitos, November 16-19 2002. IEEE COMPUTER SOCIETY.
26. A. Klivans, R. O'Donnell, and R. Servedio. Learning intersections and thresholds of halfspaces. In Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science, pages 177-186, 2002.
27. Ō(n1/3). In Proceedings of the Thirty-Third Annual Symposium on Theory of Computing, pages 258-265, 2001.
28. N. Linial and U. Vazirani. Graph products and chromatic numbers. In IEEE, editor, 30th annual Symposium on Foundations of Computer Science, October 30-November 1, 1989, Research Triangle Park, North Carolina, pages 124-128, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1989. IEEE Computer Society Press.
29. Elchanan Mossel, Ryan O'Donnell, and Rocco A. Servedio. Learning juntas. In ACM, editor, Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, 2003, pages 206-212, New York, NY, USA, 2003. ACM Press.
30. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. In Proceedings of the Thirty-Eighth Annual Symposium on Foundations of Computer Science, pages 458-467, 1997.
31. R. Nock, P. Jappy, and J. Sallantin. Generalized graph colorability and compressibility of boolean formulae. In Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC), 1998.
32. L. Pitt and R. Board. On the necessity of Occam algorithms. In Proc. 23th Annu. ACM Sympos. Theory Comput., pages 54-63. ACM Press, 1990.
33. L. Pitt and L. Valiant. Computational limitations on learning from examples. Journal of the ACM, 35(4):965-984, 1988.
34. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
35. 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.