Work

Information, Prediction, and Query by Committee

Year: 1992
Type: article
Abstract: We analyze the by 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 thresholded smooth functions.
Language: English
Open Access status: diamond
OpenAlex ID: W2110327402
FWCI: 4.355
Cites: 12
Cited by: 118
Related to: 10