Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Inference of finite automata using homing sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Negative Results for Equivalence Queries
Machine Learning
Identifying μ-formula decision trees with queries
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Teachability in computational learning
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Running time to recognize nonregular languages by 2-way probabilistic automata
Proceedings of the 18th international colloquium on Automata, languages and programming
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning read-once formulas with queries
Journal of the ACM (JACM)
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
On the query complexity of learning
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the limits of proper learnability of subclasses of DNF formulas
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
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 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
Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Machine Learning
Machine Learning
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On learning in the presence of unspecified attribute values
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
SIGACT News complexity theory column 32
ACM SIGACT News
The query complexity of finding local minima in the lattice
Information and Computation
Exact learning of DNF formulas using DNF hypotheses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On Exact Learning of Unordered Tree Patterns
Machine Learning
Learning closed horn expressions
Information and Computation
The consistency dimension and distribution-dependent learning from queries
Theoretical Computer Science
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Learnability and Definability in Trees and Similar Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract)
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
A General Dimension for Approximately Learning Boolean Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
The Complexity of Learning Concept Classes with Polynomial General Dimension
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
The Consistency Dimension, Compactness, and Query Learning
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Uniform Characterizations of Polynomial-Query Learnabilities
DS '98 Proceedings of the First International Conference on Discovery Science
How Many Queries Are Needed to Learn One Bit of Information?
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
A General Dimension for Exact Learning
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
On the Proper Learning of Axis Parallel Concepts
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Uniform characterizations of polynomial-query learnabilities
Theoretical Computer Science
How Many Queries Are Needed to Learn One Bit of Information?
Annals of Mathematics and Artificial Intelligence
On the proper learning of axis-parallel concepts
The Journal of Machine Learning Research
Theoretical Computer Science - Special issue: Algorithmic learning theory
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences - Special issue on COLT 2002
Improved Bounds on Quantum Learning Algorithms
Quantum Information Processing
The complexity of learning concept classes with polynomial general dimension
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Polynomial certificates for propositional classes
Information and Computation
Complexity parameters for first order classes
Machine Learning
A general dimension for query learning
Journal of Computer and System Sciences
Projective DNF formulae and their revision
Discrete Applied Mathematics
Query Learning and Certificates in Lattices
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Online feature elicitation in interactive optimization
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Polynomial certificates for propositional classes
Information and Computation
The subsumption lattice and query learning
Journal of Computer and System Sciences
Canonical horn representations and query learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Greedy Algorithm with Weights for Decision Tree Construction
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
How many query superpositions are needed to learn?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Time complexity of decision trees
Transactions on Rough Sets III
Proceedings of the 15th International Conference on Database Theory
Activized learning: transforming passive to active with improved label complexity
The Journal of Machine Learning Research
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.01 |
We investigate the query complexity of exact learning in the membership and (proper) equivalence query model. We give a complete characterization of concept classes that are learnable with a polynomial number of polynomial sized queries in this model. We give applications of this characterization, including results on learning a natural subclass of DNF formulas, and on learning with membership queries alone. Query complexity has previously been used to prove lower bounds on the time complexity of exact learning. We show a new relationship between query complexity and time complexity in exact learning: If any “honest” class is exactly and properly learnable with polynomial query complexity, but not learnable in polynomial time, then P = NP. In particular, we show that an honest class is exactly polynomial-query learnable if and only if it is learnable using an oracle for &Ggr;p4.