The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A result of Vapnik with applications
Overview
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“this strategy tends to be excessively loose both in theory and in practice (see, e.g., the bound of [27]).”
From Conformal Risk Control (2022) · cites this paper as [27]
Experimental — accuracy not yet measured
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
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Flagged first, then by citations
Research works printed but not linked: 8
- Baum, 1989, What size net gives valid generalization, Neural Comput., 1, 151, 10.1162/neco.1989.1.1.151 · DOI
- N. Biggs, Combinatorics and connectionism, Discrete Math., to appear. · DOI
- Blumer, 1989, Learnability and the Vapnik-Chervonenkis dimension, J. ACM, 36, 929, 10.1145/76359.76371 · DOI · Paper page
- Haussler, 1988, Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Artificial Intelligence, 36, 177, 10.1016/0004-3702(88)90002-1 · DOI
- Haussler, 1992, Decision-theoretic generalizations of the pac model for neural net and other learning applications, Inform. and Comput., 100, 78, 10.1016/0890-5401(92)90010-D · DOI
- Natarajan, 1989, On learning sets and functions, Mach. Learning, 4, 67, 10.1007/BF00114804 · DOI
- Sauer, 1972, On the density of families of sets, J. Combin. Theory Ser A, 13, 145, 10.1016/0097-3165(72)90019-2 · DOI
- Vapnik, 1971, On the uniform convergence of relative frequencies of events to their probabilities, Theoret. Prob. Appl., 16, 265, 10.1137/1116025 · DOI · Paper page
Cited by
Sorted by citations
Angelopoulos, A. N., Bates, S., Fisch, A., Lei, L., & Schuster, T. (2022) · arXiv · doi:10.48550/arxiv.2208.02814 · Cited by 37
Metadata
- Authors
- Anthony, M., & Shawe-Taylor, J.
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1993-12
- Volume
- 47
- Issue
- 3
- Pages
- 207-217
- ISSN
- 0166-218X
- Cited by
- 48
- References
- 1
- Language
- en
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
