ML Anthology

Selective Sampling Using the Query by Committee Algorithm

Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby
MLJ 1997 pp. 133-168
doi:10.1023/A:1007330508534 /mlj/1997/freund1997mlj-selective/

Abstract

We analyze the “query by committee” algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the number of queries. We show that, in particular, this exponential decrease holds for query learning of perceptrons.

PDF MLJ Semantic Scholar

Cite

Text

Freund et al. "Selective Sampling Using the Query by Committee Algorithm." Machine Learning, 1997. doi:10.1023/A:1007330508534

Markdown

[Freund et al. "Selective Sampling Using the Query by Committee Algorithm." Machine Learning, 1997.](https://mlanthology.org/mlj/1997/freund1997mlj-selective/) doi:10.1023/A:1007330508534

BibTeX

@article{freund1997mlj-selective,
  title     = {{Selective Sampling Using the Query by Committee Algorithm}},
  author    = {Freund, Yoav and Seung, H. Sebastian and Shamir, Eli and Tishby, Naftali},
  journal   = {Machine Learning},
  year      = {1997},
  pages     = {133-168},
  doi       = {10.1023/A:1007330508534},
  volume    = {28},
  url       = {https://mlanthology.org/mlj/1997/freund1997mlj-selective/}
}