ML Anthology

Bayesian Active Learning Using Arbitrary Binary Valued Queries

Liu Yang, Steve Hanneke, Jaime G. Carbonell
ALT 2010 pp. 50-58
doi:10.1007/978-3-642-16108-7_8 /alt/2010/yang2010alt-bayesian/

Abstract

We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries required to achieve a specified expected risk.

PDF ALT Semantic Scholar

Cite

Text

Yang et al. "Bayesian Active Learning Using Arbitrary Binary Valued Queries." International Conference on Algorithmic Learning Theory, 2010. doi:10.1007/978-3-642-16108-7_8

Markdown

[Yang et al. "Bayesian Active Learning Using Arbitrary Binary Valued Queries." International Conference on Algorithmic Learning Theory, 2010.](https://mlanthology.org/alt/2010/yang2010alt-bayesian/) doi:10.1007/978-3-642-16108-7_8

BibTeX

@inproceedings{yang2010alt-bayesian,
  title     = {{Bayesian Active Learning Using Arbitrary Binary Valued Queries}},
  author    = {Yang, Liu and Hanneke, Steve and Carbonell, Jaime G.},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2010},
  pages     = {50-58},
  doi       = {10.1007/978-3-642-16108-7_8},
  url       = {https://mlanthology.org/alt/2010/yang2010alt-bayesian/}
}