DMCA
Selective sampling using the Query by Committee algorithm (1997)
Cached
Download Links
by
Yoav Freund
,
H. Sebastian Seung
,
Eli Shamir
,
Naftali Tishby
| Venue: | Machine Learning |
| Citations: | 431 - 7 self |
BibTeX
@INPROCEEDINGS{Freund97selectivesampling,
author = {Yoav Freund and H. Sebastian Seung and Eli Shamir and Naftali Tishby},
title = {Selective sampling using the Query by Committee algorithm},
booktitle = {Machine Learning},
year = {1997},
pages = {133--168}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
