Efficient learning algorithms yield circuit lower bounds

Journal of Computer and System Sciences

Volumn 75, Issue 1, 2009, Pages 27-36

  Fortnow, Lance ^a   Klivans, Adam R ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Circuit lower bounds; Computational complexity; Computational learning theory; Exact learning; Hardness of learning; PAC learning

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; EQUIVALENCE CLASSES; FUNCTIONS; HARDNESS; NEURAL NETWORKS; POLYNOMIAL APPROXIMATION; TIMING CIRCUITS;

CIRCUIT LOWER BOUNDS; COMPUTATIONAL LEARNING THEORY; EXACT LEARNING; HARDNESS OF LEARNING; PAC LEARNING;

LEARNING ALGORITHMS;

EID: 56249108364     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2008.07.006     Document Type: Article

References (37)

1. M. Alekhnovich, M. Braverman, V. Feldman, A. Klivans, T. Pitassi, Learnability and automatizability, in: FOCS, IEEE Symposium on Foundations of Computer Science (FOCS), 2004
2. Arvind V., and Kobler J. On pseudorandomness and resource-bounded measure. Theoret. Comput. Sci. 255 (2001)
3. Angluin D. Queries and concept learning. Mach. Learn. 2 (1988) 319-342
4. S. Aaronson, A. Wigderson, Algebrization: A new barrier in complexity theory, Manuscript, 2007
5. Bshouty N., and Bshouty D. On interpolating arithmetic read-once formulas with exponentiation. J. Comput. System Sci. 56 (1998)
6. A. Beimel, F. Bergadano, N. Bshouty, E. Kushilevitz, S. Varricchio, On the applications of multiplicity automata in learning, in: Proceedings of the Thirty-Seventh Annual Symposium on Foundations of Computer Science, 1996, pp. 349-358
7. Beaver D., and Feigenbaum J. Hiding instances in multioracle queries. Proceedings of the 7th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Comput. Sci. vol. 415 (1990), Springer, Berlin 37-48
8. Babai L., Fortnow L., Nisan N., and Wigderson A. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Complexity 3 (1993) 307-318
9. Buhrman H., Fortnow L., and Thierauf T. Nonrelativizing separations. Proceedings of the 13th IEEE Conference on Computational Complexity (1998), IEEE, New York 8-12
10. Buhrman H., and Homer S. Superpolynomial circuits, almost sparse oracles and the exponential hierarchy. Proceedings of the 12th Conference on the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Comput. Sci. vol. 652 (1992), Springer, Berlin, Germany 116-127
11. Bshouty N., Hancock T., and Hellerstein L. Learning arithmetic read-once formulas. SIAM J. Comput. 24 (1995)
12. Bshouty N., Tamon T., and Wilson D. On learning width two branching programs. Inform. Process. Lett. 65 (1998)
13. Gold E.A. Complexity of automaton identification from given data. Inform. Control 37 (1978) 302-320
14. O. Goldreich, D. Zuckerman, Another proof that BPP ⊆ PH (and more), in: Electronic Colloquium on Computational Complexity, No. 97-045, 1997
15. Hitchcock J. Online learning and resource-bounded dimension: Winnow yields new lower bounds for hard sets. SIAM J. Comput. 36 6 (2007) 1696-1708
16. Hartmanis J., and Stearns R. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965) 285-306
17. Impagliazzo R., and Wigderson A. Randomness vs. time: Derandomization under a uniform assumption. J. Comput. System Sci. 63 4 (2001) 672-688
18. 0, in: Proceedings of the 34th ACM Symposium on Theory of Computing, 2002
19. Kannan R. Circuit-size lower bounds and non-reducibility to sparse sets. Inform. Control 55 1-3 (1982) 40-56
20. Kannan R. Circuit-size lower bounds and non-reducibility to sparse sets. Inform. Control 55 (1982) 40-56
21. M. Kharitonov, Cryptographic hardness of distribution-specific learning, in: Proceedings of the Twenty-Fifth Annual Symposium on Theory of Computing, 1993, pp. 372-381
22. Kabanets V., and Impagliazzo R. Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complexity 13 1-2 (2004) 1-46
23. Klivans A., and Shpilka A. Learning arithmetic circuits via partial derivatives. COLT, Proceedings of the Workshop on Computational Learning Theory (2003), Morgan Kaufmann Publishers
24. A. Klivans, A. Sherstov, Cryptographic hardness for learning intersections of halfspaces, in: FOCS, IEEE Symposium on Foundations of Computer Science (FOCS), 2006
25. Kearns M., and Valiant L. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM 41 1 (1994) 67-95
26. Lipton R. New directions in testing. In: Feigenbaum J., and Merritt M. (Eds). Distributed Computing and Cryptography. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 2 (1991), American Mathematical Society, Providence 191-202
27. Littlestone N. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn. 2 (1988) 285-318
28. Linial N., Mansour Y., and Nisan N. Constant depth circuits, Fourier transform, and learnability. J. ACM 40 3 (1993) 607-620
29. Lindner W., Schuler R., and Watanabe O. Resource-bounded measure and learnability. Math. Systems Theory 33 (2000)
30. P.B. Miltersen, N.V. Vinodchandran, O. Watanabe, Super-polynomial versus half-exponential circuit size in the exponential hierarchy, in: COCOON, Annual International Conference on Computing and Combinatorics, 1999
31. Pitt L., and Valiant L. Computational limitations on learning from examples. J. ACM 35 4 (1988) 965-984
32. Santhanam R. Circuit lower bounds for Merlin-Arthur classes. STOC (2007), ACM 275-283
33. Toda S. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20 5 (1991) 865-877
34. Valiant L. The complexity of computing the permanent. Theoret. Comput. Sci. 8 (1979) 189-201
35. Valiant L. A theory of the learnable. Comm. ACM 27 11 (1984) 1134-1142
36. N.V. Vinodchandran, Learning DNFs and circuits using teaching assistants, in: COCOON, Annual International Conference on Computing and Combinatorics, 2004
37. Watanabe O., and Gavalda R. Structural analysis of polynomial-time query learnability. Math. Systems Theory 27 (1994)