The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
The strength of weak learnability
Abstract
The problem of improving the accuracy of a hypothesis output by a learning algorithm in the distribution-free learning model is considered. A concept class is learnable (or strongly learnable) if, given access to a source of examples from the unknown concept, the learner with high probability is able to output a hypothesis that is correct on all but an arbitrarily small fraction of the instances. The concept class is weakly learnable if the learner can produce a hypothesis that forms only slightly better than random guessing. It is shown that these two notions of learnability are equivalent. An explicit method is described for directly converting a weak learning algorithm into one that achieves arbitrarily high accuracy. This construction may have practical applications as a tool for efficiently converting a mediocre learning algorithm into one that performs extremely well. In addition, the construction has some interesting theoretical consequences.>
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
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Angluin, D. (1988) · Machine Learning · doi:10.1007/bf00116828 · Cited by 1,905
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90114-1 · Cited by 1,054
Rivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
Finding patterns common to a set of strings
Angluin, D. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90041-0 · Cited by 616
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., & Valiant, L. G. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90045-x · Cited by 570
Computational limitations on learning from examples
Pitt, L., & Valiant, L. G. (1988) · Journal of the ACM · doi:10.1145/48014.63140 · Cited by 515
On the learnability of Boolean formulae
Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28426 · Cited by 284
Crytographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. G. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73049 · Cited by 266
Computational Complexity of Machine Learning
Kearns, M. J. (1990) · Cited by 226
Learning decision trees from random examples
Ehrenfeucht, A., & Haussler, D. H. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90001-1 · Cited by 143
Equivalence of models for polynomial learnability
Haussler, D. H., Kearns, M. J., Littlestone, N., & Warmuth, M. K. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90042-z · Cited by 134
Learning boolean formulae or finite automata is as hard as factoring
Kearns, M. J. (1988) · Medical Entomology and Zoology · Cited by 109
Learning Nested Differences of Intersection-Closed Concept Classes
Helmbold, D. P., Sloan, R. H., & Warmuth, M. K. (1990) · Machine Learning · doi:10.1023/a:1022696716689 · Cited by 95
Predicting (0, 1)-functions on randomly drawn points
Haussler, D. H., Littlestone, N., & Warmuth, M. K. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21928 · Cited by 79
On learning a union of half spaces
Baum, E. B. (1990) · Journal of Complexity · doi:10.1016/0885-064x(90)90012-3 · Cited by 76
Equivalence of models for polynomial learnability
Haussler, D. H., Kearns, M. J., Littlestone, N., & Warmuth, M. K. (1988) · Conference on Learning Theory · doi:10.5555/93025.93040 · Cited by 76
On the necessity of Occam algorithms
R. Board, & Pitt, L. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100223 · Cited by 56
Space-bounded learning and the Vapnik-Chervonenkis dimension
Floyd, S. (1989) · Conference on Learning Theory · doi:10.5555/93335.93379 · Cited by 53
Pattern languages are not learnable
Schapire, R. E. (1990) · Conference on Learning Theory · doi:10.5555/92571.92613 · Cited by 33
Self-citationSome remarks about space-complexity of learning, and circuit complexity of recognizing
Boucheron, S., & Sallantin, J. (1988) · Conference on Learning Theory · doi:10.5555/93025.93066 · Cited by 12
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Nearly unbiased variable selection under minimax concave penalty
Zhang, C.-H. (2010) · The Annals of Statistics · doi:10.1214/09-aos729 · Cited by 3,835
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953
Solving Multiclass Learning Problems via Error-Correcting Output Codes
Dietterich, T. G., & Bakiri, G. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.105 · Cited by 2,739
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
Metadata
- Authors
- Schapire, R. E.
- Venue
- 30th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 1989
- Pages
- 28-33
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2046995465
- Cited by
- 257
- References
- 24
- FWCI
- 4.61
- 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.