The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Query by committee
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fedorov, V. V., Studden, W. J., & Klimko, E. M. (1972) · Cited by 2,092
Theory of Optimal Experiments.
Herzberg, A. M., Wynn, H. P., Fedorov, V. V., Studden, W. J., & Klimko, E. M. (1972) · Biometrika · doi:10.2307/2334826 · Cited by 1,897
Statistical mechanics of learning from examples
Seung, H. S., Sompolinsky, H., & Tishby, N. (1992) · Physical Review A · doi:10.1103/physreva.45.6056 · Cited by 532
Self-citationThree unfinished works on the optimal storage capacity of networks
Gardner, E., & Derrida, B. (1989) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/22/12/004 · Cited by 188
Neural net algorithms that learn in polynomial time from examples and queries
Baum, E. B. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80287 · Cited by 168
Consistent inference of probabilities in layered networks: predictions and generalizations
Tishby, Levin, & Solla (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118274 · Cited by 161
Generalization performance of Bayes optimal classification algorithm for learning a perceptron
Opper, M., & Haussler, D. H. (1991) · Physical Review Letters · doi:10.1103/physrevlett.66.2677 · Cited by 152
Self-citationImproving a Network Generalization Ability by Selecting Examples
Kinzel, W., & Ruján, P. (1990) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/13/5/016 · Cited by 113
Selecting examples for perceptrons
Watkin, T. L. H., & Rau, A. (1992) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/25/1/016 · Cited by 32
Cited by
(2009) · Minds at UW (University of Wisconsin) · Cited by 4,791
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Machine learning and the physical sciences
Carleo, G., Cirac, I., Cranmer, K., Daudet, L., Schuld, M., Tishby, N., Vogt-Maranto, L., & Zdeborová, L. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045002 · Cited by 2,417
A sequential algorithm for training text classifiers
Lewis, D., & Gale, W. A. (1994) · arXiv (Cornell University) · doi:10.5555/188490.188495 · Cited by 1,731
Unke, O. T., Chmiela, S., Sauceda, H. E., Gastegger, M., Poltavsky, I., Schütt, K. T., Tkatchenko, A., & Müller, K.-R. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.0c01111 · Cited by 1,647
Metadata
- Authors
- Seung, H. S., Opper, M., & Sompolinsky, H.
- Venue
- Proceedings of the fifth annual workshop on Computational learning theory
- Publisher
- ACM
- Published
- 1992-07
- Pages
- 287-294
- OpenAlex
- W2080021732
- Cited by
- 1,651
- References
- 9
- FWCI
- 7.57
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.