COLT '94 Proceedings of the seventh 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 from a consistently ignorant teacher
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
Being taught can be faster than asking questions
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Malicious Omissions and Errors in Answers to Membership Queries
Machine Learning
Journal of the ACM (JACM)
Learning from examples with unspecified attribute values (extended abstract)
COLT '97 Proceedings of the tenth 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
The query complexity of finding local minima in the lattice
Information and Computation
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 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
On the learnability of shuffle ideals
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
We introduce a new fault-tolerant model of algorithmic learning using an equivalence oracle and an incomplete membership oracle, in which the answers to a random subset of the learner's membership queries may be missing. We demonstrate that, with high probability, it is still possible to learn monotone DNF formulas in polynomial time, provided that the fraction of missing answers is bounded by some constant less than one. Even when half the membership queries are expected to yield no information, our algorithm will exactly identify m-term, n-variable monotone DNF formulas with an expected O(mn2) queries. The same task has been shown to require exponential time using equivalence queries alone. We extend the algorithm to handle some one-sided errors, and discuss several other possible error models. It is hoped that this work may lead to a better understanding of the power of membership queries and the effects of faulty teachers on query models of concept learning.