Communications of the ACM
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Learning regular sets from queries and counterexamples
Information and Computation
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Negative Results for Equivalence Queries
Machine Learning
Non-uniform automata over groups
Information and Computation
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Oracles and queries that are sufficient for exact learning (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An introduction to computational learning theory
An introduction to computational learning theory
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
On the power of equivalence queries
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
More on BPP and the polynomial-time hierarchy
Information Processing Letters
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
How many queries are needed to learn?
Journal of the ACM (JACM)
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
SIAM Journal on Computing
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing
Symmetric alternation captures BPP
Computational Complexity
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Lower Bounds for (MODp - MODm) Circuits
SIAM Journal on Computing
Machine Learning
Machine Learning
On Learning Programs and Small Depth Circuits
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Abstract Combinatorial Characterizations of Exact Learning via Queries
COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We describe some recent or not-so-recent results in the model of learning known as exact learning from queries. Some results are chosen because they led to a result in complexity theory, and others are chosen because they seem to indicate an interesting line of research at the common ground of learning and complexity. More precisely, we survey: (1) an improvement of the Karp-Lipton collapse that stemmed from a learning algorithm for Boolean circuits, (2) recent advances in distinguishing information-theoretic from complexity-theoretic difficulty of learning, and (3) recent results on learning small-depth circuits with modular gates that call for a systematic study of the expressive power of so-called Multiplicity Automata.