The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
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
Self-citationBoosting a Weak Learning Algorithm by Majority
Freund, Y. (1995) · Information and Computation · doi:10.1006/inco.1995.1136 · Cited by 1,674
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
Self-citationStochastic Complexity and Modeling
Rissanen, J. (1986) · The Annals of Statistics · doi:10.1214/aos/1176350051 · Cited by 922
On the density of families of sets
Sauer, N. (1972) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(72)90019-2 · Cited by 844
ɛ-nets and simplex range queries
Haussler, D., & Welzl, E. (1987) · Discrete & Computational Geometry · doi:10.1007/bf02187876 · Cited by 723
Inferring decision trees using the minimum description lenght principle
Ross Quinlan, J., & Rivest, R. L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90010-2 · Cited by 652
Computational limitations on learning from examples
Pitt, L., & Valiant, L. G. (1988) · Journal of the ACM · doi:10.1145/48014.63140 · Cited by 515
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
Version spaces: a candidate elimination approach to rule learning
Mitchell, T. M. (1977) · International Joint Conference on Artificial Intelligence · Cited by 333
The strength of weak learnability
Schapire, R. E. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63451 · Cited by 257
Relating Data Compression and Learnability
Littlestone, N., & Warmuth, M. K. (2003) · Cited by 208
Self-citationMistake bounds and logarithmic linear-threshold learning algorithms
Littlestone, N. (1990) · Cited by 183
Boosting a weak learning algorithm by majority
Freund, Y. (1990) · Colt Proceedings 1990 · doi:10.1016/b978-1-55860-146-8.50019-9 · Cited by 163
A general lower bound on the number of examples needed for learning
Ehrenfeucht, A., Haussler, D. H., Kearns, M. J., & Valiant, L. G. (1988) · Conference on Learning Theory · doi:10.5555/93025.93068 · Cited by 138
Cesa‐Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D. H., Schapire, R. E., & Warmuth, M. K. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167198 · Cited by 129
Self-citationLearning 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
Self-citationHelmbold, D. P., Sloan, R. H., & Warmuth, M. K. (1992) · SIAM Journal on Computing · doi:10.1137/0221019 · Cited by 80
Self-citationPredicting (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
Self-citationHelmbold, D. P., & Warmuth, M. K. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1044 · Cited by 74
Self-citationBounding sample size with the Vapnik-Chervonenkis dimension
Shawe-Taylor, J. S., Anthony, M., & Biggs, N. L. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90179-r · Cited by 58
SPACE-BOUNDED LEARNING AND THE VAPNIK-CHERVONENKIS DIMENSION
Floyd, S. (1989) · Elsevier eBooks · doi:10.1016/b978-0-08-094829-4.50028-3 · Cited by 58
Self-citationSpace-bounded learning and the Vapnik-Chervonenkis dimension
Floyd, S. (1989) · Conference on Learning Theory · doi:10.5555/93335.93379 · Cited by 53
Self-citationThe Power of Self-Directed Learning
Goldman, S. A., & Sloan, R. H. (1994) · Machine Learning · doi:10.1007/bf00993977 · Cited by 42
LEARNING NESTED DIFFERENCES OF INTERSECTION-CLOSED CONCEPT CLASSES
Helmbold, D. P., Sloan, R. H., & Warmuth, M. K. (1989) · Elsevier eBooks · doi:10.1016/b978-0-08-094829-4.50006-4 · Cited by 25
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
(2015) · Cited by 2,857
Machine Learning for the Detection of Oil Spills in Satellite Radar Images
Kubat, M., Holte, R. C., & Matwin, S. (1998) · Machine Learning · doi:10.1023/a:1007452223027 · Cited by 1,243
Structural risk minimization over data-dependent hierarchies
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705570 · Cited by 527
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Clarkson, K. L. (2010) · ACM Transactions on Algorithms · doi:10.1145/1824777.1824783 · Cited by 379
Vincent, P., & Bengio, Y. (2002) · Machine Learning · doi:10.1023/a:1013955821559 · Cited by 317
Metadata
- Authors
- Floyd, S., & Warmuth, M.
- Venue
- Machine Learning
- Published
- 1995-12
- Volume
- 21
- Issue
- 3
- Pages
- 269-304
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2150434953
- Cited by
- 256
- References
- 31
- FWCI
- 3.83
- Type
- journal article
- Language
- en
- Open access
- bronze
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.
