Learning with Malicious Membership Queries and Exceptions (Extended Abstract)

Abstract

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.

Cite

Text

Angluin and Krikis. "Learning with Malicious Membership Queries and Exceptions (Extended Abstract)." Annual Conference on Computational Learning Theory, 1994. doi:10.1145/180139.181015

Markdown

[Angluin and Krikis. "Learning with Malicious Membership Queries and Exceptions (Extended Abstract)." Annual Conference on Computational Learning Theory, 1994.](https://mlanthology.org/colt/1994/angluin1994colt-learning/) doi:10.1145/180139.181015

BibTeX

@inproceedings{angluin1994colt-learning,
  title     = {{Learning with Malicious Membership Queries and Exceptions (Extended Abstract)}},
  author    = {Angluin, Dana and Krikis, Martins},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1994},
  pages     = {57-66},
  doi       = {10.1145/180139.181015},
  url       = {https://mlanthology.org/colt/1994/angluin1994colt-learning/}
}