(Enter summary)
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.
Keywords: selective sampling, query learning, Bayesian Learning, experimental design
Yoav... (Update)
Cited by: More
Active Learning with Multiple Views - Muslea (2002)
(Correct)
Journal of Machine Learning Research 7 (2006) 1205--1230 .. - For Linear..
(Correct)
Coarse Sample Complexity Bounds for Active - Learning Sanjoy Dasgupta
(Correct)
Similar documents (at the sentence level):
67.9%: Selective sampling using the Query by Committee algorithm - Freund, Seung, Shamir.. (1997)
(Correct)
56.3%: Data Filtering and Distribution Modeling Algorithms for Machine .. - Yoav Freund (1993)
(Correct)
Active bibliography (related documents): More All
0.2: Active Learning in Neural Networks - Hasenjäger, Ritter
(Correct)
0.1: On the Complexity of Function Learning - Auer, Long, Maass, Woeginger (1994)
(Correct)
0.1: Reuleaux Triangle Constants - Finch (2003)
(Correct)
Similar documents based on text: More All
0.3: Kernel Query By Committee (KQBC) - Ran Gilad-Bachrach Ranb
(Correct)
0.3: Learning From a Population of Hypotheses - Michael Kearns And (1995)
(Correct)
0.3: Query by Committee, Linear Separation and - Ran
(Correct)
Related documents from co-citation: More All
24: A sequential algorithm for training text classifiers: Corrigendum and additional..
- Lewis - 1995
20: Query by committee
- Seung, Opper et al. - 1992
20: Active learning with statistical models
- Cohn, Ghahramani et al. - 1995
BibTeX entry: (Update)
Freund, Y., Seung, H. S., Shamir, E., and Tishby, N. (1997). Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133--168. http://citeseer.ist.psu.edu/article/freund95selective.html More
@article{ freund97selective,
author = "Yoav Freund and H. Sebastian Seung and Eli Shamir and Naftali Tishby",
title = "Selective Sampling Using the Query by Committee Algorithm",
journal = "Machine Learning",
volume = "28",
number = "2-3",
pages = "133-168",
year = "1997",
url = "citeseer.ist.psu.edu/article/freund95selective.html" }
Citations (may not include all citations):
465
Learnability and the VapnikChervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
441
Queries and concept learning (context) - Angluin - 1988
132
Theory of Optimal Experiments (context) - Fedorov - 1972
123
the method of bounded differences (context) - McDiarmid - 1989
115
the density of families of sets (context) - Sauer - 1972
85
Bounds on the sample complexity of Bayesian learning using i..
- Haussler, Kearns et al. - 1991
85
Bounds on the sample complexity of Bayesian learning using i..
- Haussler, Kearns et al. - 1991
83
Query by committee
- Seung, Opper et al. - 1992
44
a measure of the information provided by an experiment (context) - Lindley - 1956
43
Neural net algorithms that learn in polynomial time from exa.. (context) - Baum - 1991
39
Optimum Experimental Designs (context) - Atkinson, Donev - 1992
39
Training connectionist networks with queries and selective s.. (context) - Cohn, Atlas et al. - 1990
20
Improving a network generalization ability by selecting exam.. (context) - Kinzel, Ruj'an - 1990
19
the sample complexity of PAC-learning using random and chose..
- Eisenberg, Rivest - 1990
14
Query learning can work poorly when a human oracle is used (context) - Baum, Lang - 1992
11
The transition to perfect generalization in perceptrons (context) - Baum, Lyuu - 1991
8
Theory of Convex Bodies (context) - Bonnesen, Fenchel - 1987
6
Some ideas on learning with directional feedback (context) - Barland - 1992
4
Convexity Methods in Variational Calculus (context) - Smith - 1985
2
Version spaces: as approach to concept learning (context) - Mitchell - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.huji.ac.il/labs/learning/Info/):
Rigorous Learning Curve Bounds from Statistical Mechanics - Haussler, Kearns, Seung.. (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC