ML Anthology

Queries Revisited

Dana Angluin
ALT 2001 pp. 12-31
doi:10.1007/3-540-45583-3_3 /alt/2001/angluin2001alt-queries/

Abstract

We begin with a brief tutorial on the problem of learning a finite concept class over a finite domain using membership queries and/or equivalence queries. We then sketch general results on the number of queries needed to learn a class of concepts, focusing on the various notions of combinatorial dimension that have been employed, including the teaching dimension, the exclusion dimension, the extended teaching dimension, the fingerprint dimension, the sample exclusion dimension, the Vapnik-Chervonenkis dimension, the abstract identification dimension, and the general dimension.

PDF ALT Semantic Scholar

Cite

Text

Angluin. "Queries Revisited." International Conference on Algorithmic Learning Theory, 2001. doi:10.1007/3-540-45583-3_3

Markdown

[Angluin. "Queries Revisited." International Conference on Algorithmic Learning Theory, 2001.](https://mlanthology.org/alt/2001/angluin2001alt-queries/) doi:10.1007/3-540-45583-3_3

BibTeX

@inproceedings{angluin2001alt-queries,
  title     = {{Queries Revisited}},
  author    = {Angluin, Dana},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2001},
  pages     = {12-31},
  doi       = {10.1007/3-540-45583-3_3},
  url       = {https://mlanthology.org/alt/2001/angluin2001alt-queries/}
}