Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Learning k-term DNF formulas with an incomplete membership oracle
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
A computational model of teaching
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Learning read-once formulas with queries
Journal of the ACM (JACM)
Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Asking questions to minimize errors
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Parameterized learning complexity
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the query complexity of learning
COLT '93 Proceedings of the sixth 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
Learning from a consistently ignorant teacher
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
How many queries are needed to learn?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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)
A competitive approach to game learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning deterministic finite automata from smallest counterexamples
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Almost all monotone Boolean functions are polynomially learnable using membership queries
Information Processing Letters
SIGACT News complexity theory column 32
ACM SIGACT News
The query complexity of finding local minima in the lattice
Information and Computation
The consistency dimension and distribution-dependent learning from queries
Theoretical Computer Science
Even linear simple matrix languages: formal language properties and grammatical inference
Theoretical Computer Science
How Many Missing Answers Can Be Tolerated by Query Learners?
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Learning Multiplicity Automata from Smallest Counterexamples
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Exact Learning when Irrelevant Variables Abound
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract)
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Minimal Covers of Functional Dependencies with Queries
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th 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
Uniform Characterizations of Polynomial-Query Learnabilities
DS '98 Proceedings of the First International Conference on Discovery Science
Learning Regular Sets with an Incomplete Membership Oracle
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
Exploring Learnability between Exact and PAC
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Uniform characterizations of polynomial-query learnabilities
Theoretical Computer Science
Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Theoretical Computer Science - Special issue: Algorithmic learning theory
Theory revision with queries: horn, read-once, and parity formulas
Artificial Intelligence
Exploring learnability between exact and PAC
Journal of Computer and System Sciences - Special issue on COLT 2002
A general dimension for query learning
Journal of Computer and System Sciences
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Query Learning and Certificates in Lattices
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A Note on the Relationship between Different Types of Correction Queries
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Journal of Automata, Languages and Combinatorics
Learning Minimal Separating DFA's for Compositional Verification
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Efficiency versus convergence of Boolean kernels for on-line learning algorithms
Journal of Artificial Intelligence Research
Learning conditional preference networks with queries
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A bibliographical study of grammatical inference
Pattern Recognition
MAT learners for recognizable tree languages and tree series
Acta Cybernetica
Learning from a smarter teacher
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Learning conditional preference networks
Artificial Intelligence
Algorithms and theory of computation handbook
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Generalizing over several learning settings
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Learning finite state machines
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Zulu: an interactive learning competition
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Gramin: a system for incremental learning of programming language grammars
Proceedings of the 4th India Software Engineering Conference
Types of trusted information that make DFA identification with correction queries feasible
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
On learning multivalued dependencies with queries
Theoretical Computer Science
Learning a subclass of k-quasi-Horn formulas with membership queries
Information Processing Letters
Learning stochastic logical automaton
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
Assisting scientific discovery with an adaptive problem solver
DS'05 Proceedings of the 8th international conference on Discovery Science
Query-based learning of XPath expressions
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Proceedings of the 15th International Conference on Database Theory
Learning minimal deterministic automata from inexperienced teachers
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.01 |
We consider the problem of exact identification of classes of concepts using only equivalence queries. We define a combinatorial property, approximate fingerprints, of classes of concepts and show that no class with this property can be exactly identified in polynomial time using only equivalence queries. As applications of this general theorem, we show that there is no polynomial time algorithm using only equivalence queries that exactly identifies deterministic or nondeterministic finite state acceptors, context free grammars, or disjunctive or conjunctive normal form boolean formulas.