A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Efficient Learning Algorithms Yield Circuit Lower Bounds
[chapter]

2006
*
Lecture Notes in Computer Science
*

We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circuit class C in Angluin's model of exact learning from membership and equivalence queries or in Valiant's PAC model yields a lower bound against C . More specifically, we prove that any subexponential time, deterministic exact learning algorithm for C (from membership and equivalence queries) implies the existence of a

doi:10.1007/11776420_27
fatcat:2doc46s7mba7bk4dzhjxaznsti