Communications of the ACM
A general lower bound on the number of examples needed for learning
Information and Computation
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Negative Results for Equivalence Queries
Machine Learning
Teachability in computational learning
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Lower Bound Methods and Separation Results for On-Line Learning Models
Machine Learning - Computational learning theory
Decision trees for geometric models
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Journal of Computer and System Sciences
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
How many queries are needed to learn?
Journal of the ACM (JACM)
The consistency dimension and distribution-dependent learning from queries
Theoretical Computer Science
Machine Learning
Machine Learning
Relations between gold-style learning and query learning
Information and Computation
Polynomial certificates for propositional classes
Information and Computation
Active Coevolutionary Learning of Deterministic Finite Automata
The Journal of Machine Learning Research
The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx
Neural Computation
A general comparison of language learning from examples and from queries
Theoretical Computer Science
Projective DNF formulae and their revision
Discrete Applied Mathematics
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Knows what it knows: a framework for self-aware learning
Proceedings of the 25th international conference on Machine learning
Query Learning and Certificates in Lattices
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning Balls of Strings from Edit Corrections
The Journal of Machine Learning Research
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Journal of Computer and System Sciences
DS '08 Proceedings of the 11th International Conference on Discovery Science
Recent Developments in Algorithmic Teaching
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Query-driven constraint acquisition
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Relations between Gold-style learning and query learning
Information and Computation
Polynomial certificates for propositional classes
Information and Computation
Teaching dimension and the complexity of active learning
COLT'07 Proceedings of the 20th annual conference on Learning theory
Canonical horn representations and query learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Zulu: an interactive learning competition
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Teaching randomized learners with feedback
Information and Computation
Active learning using on-line algorithms
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
On the power of lower bound methods for one-way quantum communication complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A pragmatic logic of scientific discovery
DS'06 Proceedings of the 9th international conference on Discovery Science
Gold-style and query learning under various constraints on the target class
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Assisting scientific discovery with an adaptive problem solver
DS'05 Proceedings of the 8th international conference on Discovery Science
The Journal of Machine Learning Research
ALFRED: crowd assisted data extraction
Proceedings of the 22nd international conference on World Wide Web companion
A framework for learning web wrappers from the crowd
Proceedings of the 22nd international conference on World Wide Web
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We begin with a brief tutorial on the problem of learning a finite concept class over a finite domain using membership queries and/or equivalence queries. We then sketch general results on the number of queries needed to learn a class of concepts, focusing on the various notions of combinatorial dimension that have been employed, including the teaching dimension, the exclusion dimension, the extended teaching dimension, the fingerprint dimension, the sample exclusion dimension, the Vapnik-Chervonenkis dimension, the abstract identification dimension, and the general dimension.