The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Risk bounds for statistical learning
Open accessAbstract
We propose a general theorem providing upper bounds for the risk of an empirical risk minimizer (ERM).We essentially focus on the binary classification framework. We extend Tsybakov’s analysis of the risk of an ERM under margin type conditions by using concentration inequalities for conveniently weighted empirical processes. This allows us to deal with ways of measuring the “size” of a class of classifiers other than entropy with bracketing as in Tsybakov’s work. In particular, we derive new risk bounds for the ERM when the classification rules belong to some VC-class under margin conditions and discuss the optimality of these bounds in a minimax sense.
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.
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
Estimation of Dependences Based on Empirical Data
Vapnik, V. (2006) · Information Science and Statistics · doi:10.1007/0-387-34239-7 · Cited by 2,238
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
Algorithms in Combinatorial Geometry
Edelsbrunner, H. (1987) · Springer eBooks · doi:10.1007/978-3-642-61568-9 · Cited by 1,534
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Uniform Central Limit Theorems
Dudley, R. M. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511665622 · Cited by 785
Concentration Inequalities and Model Selection
(2007) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-48503-2 · Cited by 744
Self-citationRisk 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
Self-citationOptimal aggregation of classifiers in statistical learning
Tsybakov, A. B. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120131 · Cited by 582
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
New concentration inequalities in product spaces
Talagrand, M. (1996) · Inventiones Mathematicae · doi:10.1007/s002220050108 · Cited by 501
Minimax Theory of Image Reconstruction
Korostelev, A. P., & Tsybakov, A. B. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2712-0 · Cited by 483
Smooth discrimination analysis
Mammen, E., & Tsybakov, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939240 · Cited by 377
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
Self-citationYu, B. (1997) · Festschrift for Lucien Le Cam · doi:10.1007/978-1-4612-1880-7_29 · Cited by 309
Sphere 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
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
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
Self-citationA central limit theorem for empirical processes
Pollard, D. (1982) · Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · doi:10.1017/s1446788700018371 · Cited by 134
Reynaud-Bouret, P. (2003) · Probability Theory and Related Fields · doi:10.1007/s00440-003-0259-1 · Cited by 111
Pattern Classification and Learning Theory
Lugosi, G. (2002) · Springer eBooks · doi:10.1007/978-3-7091-2568-7_1 · Cited by 89
A New Lower Bound for Multiple Hypothesis Testing
Birgé, L. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844101 · Cited by 61
Lower bounds in pattern recognition and learning
Devroye, L., & Lugosi, G. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00141-8 · Cited by 57
Cited by
Concentration Inequalities and Model Selection
(2007) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-48503-2 · Cited by 744
Self-citationTheory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
Koltchinskii, V. (2011) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-22147-7 · Cited by 346
Fast learning rates for plug-in classifiers
Audibert, J.-Y., & Tsybakov, A. B. (2007) · The Annals of Statistics · doi:10.1214/009053606000001217 · Cited by 326
Who Should Be Treated? Empirical Welfare Maximization Methods for Treatment Choice
Kitagawa, T., & Tetenov, A. (2018) · Econometrica · doi:10.3982/ecta13288 · Cited by 277
Metadata
- Authors
- Massart, P., & Nédélec, É.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2006-10-01
- Volume
- 34
- Issue
- 5
- Pages
- 2326-2366
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2076541756
- Cited by
- 253
- References
- 23
- FWCI
- 10.33
- 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.