The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Model Selection and Error Estimation
Open accessOverview
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
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
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
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
An Introduction to Support Vector Machines
Cristianini, N., & Shawe-Taylor, J. S. (2000) · ePrints Soton (University of Southampton) · Cited by 4,115
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-citationOn 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
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Self-citationEstimation of Dependences Based on Empirical Data
Vapnik, V. (2006) · Information Science and Statistics · doi:10.1007/0-387-34239-7 · Cited by 2,238
Mallows, C. L. (1995) · Technometrics · doi:10.1080/00401706.1995.10484370 · Cited by 2,083
A Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
Self-citationProbability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.2307/2282952 · Cited by 1,166
Tsai, C.-L., & Gallant, A. R. (1989) · Journal of the American Statistical Association · doi:10.2307/2289891 · Cited by 1,086
Mallows, C. L. (1995) · Technometrics · doi:10.2307/1269729 · Cited by 1,080
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
Gallant, A. R. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316719 · Cited by 803
Weak Convergence and Empirical Processes
Mikosch, T., der Vaart, A. W. V., & Wellner, J. A. (1997) · Journal of the American Statistical Association · doi:10.2307/2965734 · Cited by 765
Boosting the margin: A new explanation for the effectiveness of voting methods
Schapire, R. E., Freund, Y., Barlett, P., & Lee, W. S. (1997) · Cited by 711
Risk bounds for model selection via penalization
Barron, A., Birgé, L., & Massart, P. (1999) · Probability Theory and Related Fields · doi:10.1007/s004400050210 · Cited by 657
Information-theoretic determination of minimax rates of convergence
Yang, Y., & Barron, A. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939142 · Cited by 555
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
Self-citationMinimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
LEDA: A platform for combinatorial and geometric computing
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90217-7 · Cited by 489
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
Measuring the VC-Dimension of a Learning Machine
Vapnik, V., Levin, E., & Cun, Y. L. (1994) · Neural Computation · doi:10.1162/neco.1994.6.5.851 · Cited by 388
Convergence Rate of Sieve Estimates
Shen, X., & Wong, W. H. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325486 · Cited by 373
Rademacher penalties and structural risk minimization
Koltchinskii, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930926 · Cited by 373
Nonparametric Maximum Likelihood Estimation by the Method of Sieves
Geman, S., & Hwang, C.-R. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345782 · Cited by 367
From Model Selection to Adaptive Estimation
Birgé, L., & Massart, P. (1997) · Festschrift for Lucien Le Cam · doi:10.1007/978-1-4612-1880-7_4 · Cited by 344
The best constants in the Khintchine inequality
Haagerup, U. (1981) · Studia Mathematica · doi:10.4064/sm-70-3-231-283 · Cited by 338
Minimum Contrast Estimators on Sieves: Exponential Bounds and Rates of Convergence
Birgé, L., Massart, P., & Birgé, L. (1998) · Bernoulli · doi:10.2307/3318720 · Cited by 326
Kwek, L. C., & Oh, C. H. (1998) · The European Physical Journal C · doi:10.1007/s100520050261 · Cited by 324
Generalization Performance of Support Vector Machines and Other Pattern Classifiers
Bartlett, P. L., & Shawe-Taylor, J. S. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/1130.003.0007 · Cited by 286
Self-citationOn the best constants in the Khinchin inequality
Szarek, S. (1976) · Studia Mathematica · doi:10.4064/sm-58-2-197-208 · Cited by 249
Some applications of concentration inequalities to statistics
Massart, P. (2000) · Annales de la Faculté des sciences de Toulouse : Mathématiques · doi:10.5802/afst.961 · Cited by 240
Rademacher 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 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-citationAn experimental and theoretical comparison of model selection methods
Kearns, M., Mansour, Y., Ng, A. Y., & Ron, D. (1995) · Proceedings of the eighth annual conference on Computational learning theory - COLT '95 · doi:10.1145/225298.225301 · Cited by 167
Complexity Regularization with Application to Artificial Neural Networks
Barron, A. R. (1991) · Nonparametric Functional Estimation and Related Topics · doi:10.1007/978-94-011-3222-0_42 · Cited by 160
Nonparametric estimation via empirical risk minimization
Lugosi, G., & Zeger, K. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382014 · Cited by 147
Self-citationAn asymptotic property of model selection criteria
Yang, Y., & Barron, A. R. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.650993 · Cited by 99
Radial basis function networks and complexity regularization in function learning
Krzyżak, A., & Linder, T. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.661120 · Cited by 93
Concept learning using complexity regularization
Lugosi, G., & Zeger, K. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481777 · Cited by 64
Self-citationAdaptive model selection using empirical complexities
Lugosi, G., & Nobel, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939241 · Cited by 62
Self-citationSelf bounding learning algorithms
Freund, Y. (1998) · doi:10.1145/279943.279993 · Cited by 48
Learning by canonical smooth estimation. II. Learning and choice of model complexity
Buescher, K. L., & Kumar, P. R. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.489276 · Cited by 26
Learning by canonical smooth estimation. I. Simultaneous estimation
Buescher, K. L., & Kumar, P. R. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.489275 · Cited by 24
(1998)
Cited by
A survey of cross-validation procedures for model selection
Arlot, S., & Celisse, A. (2010) · Statistics Surveys · doi:10.1214/09-ss054 · Cited by 3,522
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
Self-citationConcentration Inequalities: A Nonasymptotic Theory of Independence
Boucheron, S., Lugosi, G., & Massart, P. (2013) · doi:10.1093/acprof:oso/9780199535255.001.0001 · Cited by 1,768
Self-citationFoundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Concentration Inequalities and Model Selection
(2007) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-48503-2 · Cited by 744
Metadata
- Authors
- Bartlett, P. L., Boucheron, S., & Lugosi, G.
- Venue
- Machine Learning
- Published
- 2002-07
- Volume
- 48
- Issue
- 1-3
- Pages
- 85-113
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W3022552533
- Cited by
- 297
- References
- 57
- FWCI
- 19.07
- 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.