The DOI matches its Crossref record; 80 of the 80 references it cites were found in a registry or an index.
Introduction to Statistical Learning Theory
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
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
Weak Convergence and Empirical Processes
van der Vaart, A. W., & Wellner, J. A. (1996) · Springer Series in Statistics · doi:10.1007/978-1-4757-2545-2 · Cited by 5,014
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Self-citationPattern Classification and Scene Analysis.
Clarke, M. R. B., Duda, R. O., & Hart, P. E. (1974) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344977 · Cited by 3,222
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
Discriminant Analysis and Statistical Pattern Recognition.
Hawkins, D. M., & McLachlan, G. J. (1993) · Journal of the American Statistical Association · doi:10.2307/2290355 · Cited by 2,633
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
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
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
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Introduction to Statistical Pattern Recognition
(2011) · Statistical Pattern Recognition · doi:10.1002/9781119952954.ch1 · Cited by 1,597
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
Discriminant Analysis and Statistical Pattern Recognition
McLachlan, G. J. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/0471725293 · Cited by 1,267
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
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
Concentration of measure and isoperimetric inequalities in product spaces
Talagrand, M. (1995) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699376 · Cited by 829
Uniform Central Limit Theorems
Dudley, R. M. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511665622 · Cited by 785
Neural Network Learning: Theoretical Foundations
Anthony, M., & Bartlett, P. L. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624216 · Cited by 598
Central Limit Theorems for Empirical Measures
Dudley, R. M. (1978) · The Annals of Probability · doi:10.1214/aop/1176995384 · Cited by 571
New concentration inequalities in product spaces
Talagrand, M. (1996) · Inventiones Mathematicae · doi:10.1007/s002220050108 · Cited by 501
A combinatorial problem; stability and order for models and theories in infinitary languages
Shelah, S. (1972) · Pacific Journal of Mathematics · doi:10.2140/pjm.1972.41.247 · Cited by 491
Sharper Bounds for Gaussian and Empirical Processes
Talagrand, M. (1994) · The Annals of Probability · doi:10.1214/aop/1176988847 · Cited by 480
Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
Koltchinskii, V., & Panchenko, D. (2002) · The Annals of Statistics · doi:10.1214/aos/1015362183 · Cited by 451
A Theory of Pattern Recognition
Амари, Ш.-И. (1968) · Jidō seigyo/Jido seigyo · Cited by 443
Some Limit Theorems for Empirical Processes
Gine, E., & Zinn, J. (1984) · The Annals of Probability · doi:10.1214/aop/1176993138 · Cited by 432
McDiarmid, C. (1998) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12788-9_6 · Cited by 405
A general lower bound on the number of examples needed for learning
Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90002-3 · Cited by 403
Rademacher penalties and structural risk minimization
Koltchinskii, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930926 · Cited by 373
中澤, 真. (1997) · Medical Entomology and Zoology · Cited by 354
Scale-sensitive dimensions, uniform convergence, and learnability
Alon, N., Ben-David, S., Cesa-Bianchi, N., & Haussler, D. (1997) · Journal of the ACM · doi:10.1145/263867.263927 · Cited by 340
Isoperimetry and Gaussian analysis
Ledoux, M. (1996) · Lecture Notes in Mathematics · doi:10.1007/bfb0095676 · Cited by 328
Talagrand, M. (1996) · The Annals of Probability · doi:10.1214/aop/1042644705 · Cited by 325
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Self-citationSphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
Haussler, D. (1995) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(95)90052-7 · Cited by 288
About the constants in Talagrand's concentration inequalities for empirical processes
Massart, P. (2000) · The Annals of Probability · doi:10.1214/aop/1019160263 · Cited by 280
A Bennett concentration inequality and its application to suprema of empirical processes
Bousquet, O. (2002) · Comptes Rendus. Mathématique · doi:10.1016/s1631-073x(02)02292-6 · Cited by 262
Self-citationBounding $\bar{d}$-distance by informational divergence: a method to prove measure concentration
Marton, K. (1996) · The Annals of Probability · doi:10.1214/aop/1039639365 · Cited by 261
On Talagrand's deviation inequalities for product measures
Ledoux, M. (1997) · ESAIM: Probability and Statistics · doi:10.1051/ps:1997103 · Cited by 255
Machine Learning: A Theoretical Approach
NATARAJAN, B. K. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 253
Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
Vapnik, V. N., & Chervonenkis, A. Y. (1982) · Theory of Probability and Its Applications · doi:10.1137/1126059 · Cited by 236
Concentration inequalities using the entropy method
Boucheron, S., Lugosi, G., & Massart, P. (2003) · The Annals of Probability · doi:10.1214/aop/1055425791 · Cited by 235
Self-citationRademacher Processes and Bounding the Risk of Function Learning
Koltchinskii, V., & Panchenko, D. (2000) · High Dimensional Probability II · doi:10.1007/978-1-4612-1358-1_29 · Cited by 209
A measure concentration inequality for contracting markov chains
Marton, K. (1996) · Geometric and Functional Analysis · doi:10.1007/bf02249263 · Cited by 202
A sharp concentration inequality with applications
Boucheron, S., Lugosi, G., & Massart, P. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(200005)16:3<277::aid-rsa4>3.0.co;2-1 · Cited by 185
Self-citationBounds on conditional probabilities with applications in multi-user communication
Ahlswede, R., G�cs, P., & K�rner, J. (1976) · Probability Theory and Related Fields · doi:10.1007/bf00535682 · Cited by 181
A simple proof of the blowing-up lemma (Corresp.)
Marton, K. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057176 · Cited by 172
A Few Notes on Statistical Learning Theory
Mendelson, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_1 · Cited by 161
Learning pattern classification-a survey
Kulkarni, S. R., Lugosi, G., & Venkatesh, S. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720536 · Cited by 161
Self-citationSome special vapnik-chervonenkis classes
Wenocur, R. S., & Dudley, R. M. (1981) · Discrete Mathematics · doi:10.1016/0012-365x(81)90274-0 · Cited by 143
Universal Donsker Classes and Metric Entropy
Dudley, R. M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5821-1_19 · Cited by 141
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
Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks
Karpiński, M., & Macintyre, A. J. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1477 · Cited by 138
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
Goldberg, P. W., & Jerrum, M. (1993) · Conference on Learning Theory · doi:10.1145/168304.168377 · Cited by 133
Moment Inequalities for Functions of Independent Random Variables
Boucheron, S., Bousquet, O., Lugosi, G., & Massart, P. (2005) · Cited by 133
Self-citationHoffmann-Jørgensen, J. (1977) · Lecture notes in mathematics · doi:10.1007/bfb0097492 · Cited by 125
Localized Rademacher Complexities
Bartlett, P. L., Bousquet, O., & Mendelson, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45435-7_4 · Cited by 111
Self-citationAssouad, P. (1983) · Annales de l’institut Fourier · doi:10.5802/aif.938 · Cited by 108
Universal Donsker Classes and Metric Entropy
Dudley, R. M. (1987) · The Annals of Probability · doi:10.1214/aop/1176991978 · Cited by 102
Information inequalities and concentration of measure
Dembo, A. (1997) · The Annals of Probability · doi:10.1214/aop/1024404424 · Cited by 91
Neural Networks with Quadratic VC Dimension
Koiran, P., & Sontag, E. D. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1479 · Cited by 91
Pattern Classification and Learning Theory
Lugosi, G. (2002) · Springer eBooks · doi:10.1007/978-3-7091-2568-7_1 · Cited by 89
Self-citationÉcole d'Été de Probabilités de Saint-Flour XII - 1982
Dudley, R. M., Kunita, H., & Ledrappier, F. (1984) · Lecture notes in mathematics · doi:10.1007/bfb0099431 · Cited by 84
Concentration for Independent Permutations
McDiarmid, C. (2002) · Combinatorics Probability Computing · doi:10.1017/s0963548301005089 · Cited by 75
Finiteness results for sigmoidal “neural” networks
Macintyre, A. J., & Sontag, E. D. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167192 · Cited by 70
Symmetrization approach to concentration inequalities for empirical processes
Panchenko, D. (2003) · The Annals of Probability · doi:10.1214/aop/1068646378 · Cited by 56
Balls in Rk do not cut all subsets of k + 2 points
Dudley, R. M. (1979) · Advances in Mathematics · doi:10.1016/0001-8708(79)90047-1 · Cited by 55
Some Extensions of an Inequality of Vapnik and Chervonenkis
Panchenko, D. (2002) · Electronic Communications in Probability · doi:10.1214/ecp.v7-1047 · Cited by 41
Existence of submatrices with all possible columns
Steele, J. M. (1978) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(78)90046-8 · Cited by 27
Concentration for locally acting permutations
Luczak, M., & McDiarmid, C. (2003) · Discrete Mathematics · doi:10.1016/s0012-365x(02)00628-3 · Cited by 21
A Note on Talagrand's Concentration Inequality
Panchenko, D. (2001) · Electronic Communications in Probability · doi:10.1214/ecp.v6-1034 · Cited by 17
Cited by
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
Fisher, A., Rudin, C., & Dominici, F. (2018) · arXiv · doi:10.48550/arxiv.1801.01489 · Cited by 1,165
Philosophy and the practice of Bayesian statistics
Gelman, A., & Shalizi, C. R. (2013) · British Journal of Mathematical and Statistical Psychology · doi:10.1111/j.2044-8317.2011.02037.x · Cited by 825
“Some results in statistical learning theory establish that certain procedures are “probably approximately correct” in what’s called a “distribution-free” manner (Bousquet et al., 2004; Vidyasagar, 2003); some of these results embrace Bayesian updating (McAllister, 1999).”
(2011) · Cited by 675
Metadata
- Authors
- Bousquet, O., Boucheron, S., & Lugosi, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 169-207
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2111296615
- Cited by
- 503
- References
- 80
- FWCI
- 4.99
- 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.