Selective Sampling Using the Query by Committee Algorithm

Yoav Freund; H. Sebastian Seung; Eli Shamir; Naftali Tishby

doi:10.1023/a:1007330508534

Selective Sampling Using the Query by Committee Algorithm

Yoav Freund
, H. Sebastian Seung
, Eli Shamir
, Naftali Tishby

Research output: Contribution to journal › Article › peer-review

720 Scopus citations

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 perceptions.

Original language	English (US)
Pages (from-to)	133-168
Number of pages	36
Journal	Machine Learning
Volume	28
Issue number	2-3
DOIs	https://doi.org/10.1023/a:1007330508534
State	Published - 1997
Externally published	Yes

ASJC Scopus subject areas

Software
Artificial Intelligence

Keywords

Bayesian Learning
Experimental design
Query learning
Selective sampling

Access to Document

10.1023/a:1007330508534

Cite this

@article{69d3ff4d6f1145e0a0b9d8ec076e695a,

title = "Selective Sampling Using the Query by Committee Algorithm",

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 perceptions.",

keywords = "Bayesian Learning, Experimental design, Query learning, Selective sampling",

author = "Yoav Freund and Seung, \{H. Sebastian\} and Eli Shamir and Naftali Tishby",

year = "1997",

doi = "10.1023/a:1007330508534",

language = "English (US)",

volume = "28",

pages = "133--168",

journal = "Machine Learning",

issn = "0885-6125",

publisher = "Springer Netherlands",

number = "2-3",

}

TY - JOUR

T1 - Selective Sampling Using the Query by Committee Algorithm

AU - Freund, Yoav

AU - Seung, H. Sebastian

AU - Shamir, Eli

AU - Tishby, Naftali

PY - 1997

Y1 - 1997

N2 - 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 perceptions.

AB - 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 perceptions.

KW - Bayesian Learning

KW - Experimental design

KW - Query learning

KW - Selective sampling

UR - https://www.scopus.com/pages/publications/0031209604

UR - https://www.scopus.com/pages/publications/0031209604#tab=citedBy

U2 - 10.1023/a:1007330508534

DO - 10.1023/a:1007330508534

M3 - Article

SN - 0885-6125

VL - 28

SP - 133

EP - 168

JO - Machine Learning

JF - Machine Learning

IS - 2-3

ER -

Selective Sampling Using the Query by Committee Algorithm

Abstract

ASJC Scopus subject areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this