ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Query by committee
Full text PdfPdf (775 KB)
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the fifth annual workshop on Computational learning theory table of contents
Pittsburgh, Pennsylvania, United States
Pages: 287 - 294  
Year of Publication: 1992
ISBN:0-89791-497-X
Authors
H. S. Seung  Racah Institute of Physics and Center for Neural Computation, Hebrew University, Jerusalem 91904, Israel
M. Opper  Institut für Theoretische Physik, Justus-Liebig-Universität Giessen, D-6300 Giessen, Germany
H. Sompolinsky  Racah Institute of Physics and Center for Neural Computation, Hebrew University, Jerusalem 91904, Israel
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 86,   Citation Count: 101
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/130385.130417
What is a DOI?

ABSTRACT

We propose an algorithm called query by commitee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal disagreement. The algorithm is studied for two toy models: the high-low game and perceptron learning of another perceptron. As the number of queries goes to infinity, the committee algorithm yields asymptotically finite information gain. This leads to generalization error that decreases exponentially with the number of examples. This in marked contrast to learning from randomly chosen inputs, for which the information gain approaches zero and the generalization error decreases with a relatively slow inverse power law. We suggest that asymptotically finite information gain may be an important characteristic of good query algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Bau91
E. Baum. Neural net algorithms that learn in polynomial time from examples and queries. IEEE Trans. in Neural Networks, 2:5-19, 1991.
 
Fed72
V. V. Fedorov. Theory of Optimal Experiments. Academic Press, New York, 1972.
 
GD89
E. Gardner and B. Derrida. Three unfinished works on the optimal storage capacity of networks. J. Phys., A22:1983-1994, 1989.
 
GT90
G. GySrgyi and N. Tishby. Statistical theory oxc learn{rig a rule. In W. I~. rI)heumann and R. KSberle, editors, Neural Networks and Spin Glasses, pages 3-36, Singapore, 1990. World Scientific.
 
HKS91
 
KR90
W. Kinzel and P. Ruj~n. Improving a network generalization ability by selecting examples. Europhys. Lett., 13:473-477, 1990.
 
MP88
M. L. Minsky and S. Papert. Percep~rons. MIT Press, Cambridge, expanded edition, 1988.
 
OH91
M. Opper and D. Haussler. Generalization performance of bayes optimal classification algorithm for learning a perceptron. Phys. Rev. Left., 66:2677-2680, 1991.
 
SST92
H. S. Seung, H. Sompolinsky, and N. Tishby. Statistical mechanics of learning from examples. Phys. Rev., A45:6056-6091, 1992.
 
TLS89
N. Tishby, E. Levin, and S. Solla. Consistent inference of probabilities in layered networks: Predictions and generalization. In Proc. Int. Joint Conf. on Neural Networks, volume 2, pages 403-409, Washington, DC, 1989. IEEE.
 
WR92
T.L.H. Watkin and A. Rau. Selecting examples for perceptrons. J. Phys., A25:113-121, 1992.

CITED BY  101

Collaborative Colleagues:
H. S. Seung: colleagues
M. Opper: colleagues
H. Sompolinsky: colleagues