Learning regular sets from queries and counterexamples
Information and Computation
Computational limitations on learning from examples
Journal of the ACM (JACM)
Negative Results for Equivalence Queries
Machine Learning
COLT '90 Proceedings of the third annual workshop on Computational learning theory
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On learning from queries and counterexamples in the presence of noise
Information Processing Letters
Learning monotone DNF with an incomplete membership oracle
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning 2u DNF formulas and ku decision trees
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning read-once formulas over fields and extended bases
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Exact learning of read-twice DNF formulas (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fast learning of k-term DNF formulas with queries
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Machine Learning
Machine Learning
Learning Read-Once Formulas with Queries
Learning Read-Once Formulas with Queries
Learning fallible finite state automata
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning with malicious membership queries and exceptions (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning with queries but incomplete information (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning with unreliable boundary queries
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Malicious Omissions and Errors in Answers to Membership Queries
Machine Learning
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The query complexity of finding local minima in the lattice
Information and Computation
Generalized Graph Colorability and Compressibility of Boolean Formulae
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
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
Learning monotone dnf from a teacher that almost does not answer membership queries
The Journal of Machine Learning Research
Learning with errors in answers to membership queries
Journal of Computer and System Sciences
Separating Models of Learning with Faulty Teachers
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Separating models of learning with faulty teachers
Theoretical Computer Science
Active learning with multiple views
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We consider the problem of learning k-term DNF formulas using equivalence queries and incomplete membership queries as defined by Angluin and Slonim. We demonstrate that this model can be applied to non-monotone classes. Namely, we describe a polynomial-time algorithm that constructs a k-term DNF formula representationally equivalent to the target using incomplete membership queries and equivalence queries from the class of DNF formulas.