Learning regular sets from queries and counterexamples
Information and Computation
On learning from queries and counterexamples in the presence of noise
Information Processing Letters
Learning k-term DNF formulas with an incomplete membership oracle
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the necessity of Occam algorithms
Theoretical Computer Science
Exact identification of read-once formulas using fixed points of amplification functions
SIAM Journal on Computing
Learning fallible finite state automata
COLT '93 Proceedings of the sixth 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
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
Machine Learning - Special issue on computational learning theory
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
DNF—if you can't learn'em, teach'em: an interactive model of teaching
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Malicious Omissions and Errors in Answers to Membership Queries
Machine Learning
Learning from examples with unspecified attribute values (extended abstract)
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning Intermediate Concepts
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Theoretical Computer Science
Learning attribute-efficiently with corrupt oracles
Theoretical Computer Science
Learning attribute-efficiently with corrupt oracles
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
We consider two issues in polynomial-time exact learning of concepts using membership and equivalence queries: (1) malicious errors in the answers to membership queries and (2) learning finite variants of concepts drawn from a learnable class.