The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Fast learning rates for plug-in classifiers
Open accessAbstract
It has been recently shown that, under the margin (or low noise) assumption, there exist classifiers attaining fast rates of convergence of the excess Bayes risk, that is, rates faster than n−1/2. The work on this subject has suggested the following two conjectures: (i) the best achievable fast rate is of the order n−1, and (ii) the plug-in classifiers generally converge more slowly than the classifiers based on empirical risk minimization. We show that both conjectures are not correct. In particular, we construct plug-in classifiers that can achieve not only fast, but also super-fast rates, that is, rates faster than n−1. We establish minimax lower bounds showing that the obtained rates cannot be improved.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
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
A Distribution-Free Theory of Nonparametric Regression
Györfi, L., Kohler, M., Krzyżak, A., & Walk, H. (2002) · Springer Series in Statistics · doi:10.1007/b97848 · Cited by 1,738
Optimal Global Rates of Convergence for Nonparametric Regression
Stone, C. J. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345969 · Cited by 1,497
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Optimal Rates of Convergence for Nonparametric Estimators
Stone, C. J. (1980) · The Annals of Statistics · doi:10.1214/aos/1176345206 · Cited by 795
Optimal aggregation of classifiers in statistical learning
Tsybakov, A. B. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120131 · Cited by 582
Self-citationInformation-theoretic determination of minimax rates of convergence
Yang, Y., & Barron, A. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939142 · Cited by 555
Empirical Processes in M-Estimation
van de Geer, S. (2000) · Cited by 530
ε-Entropy and ε-Capacity of Sets In Functional Spaces
Tikhomirov, V. M. (1993) · Mathematics and Its Applications · doi:10.1007/978-94-017-2973-4_7 · Cited by 488
Cited by
Choice of neighbor order in nearest-neighbor classification
Hall, P., Park, B. U., & Samworth, R. J. (2008) · The Annals of Statistics · doi:10.1214/07-aos537 · Cited by 329
Classification with a Reject Option using a Hinge Loss
Bartlett, P. L., & Wegkamp, M. H. (2008) · QUT ePrints (Queensland University of Technology) · doi:10.5555/1390681.1442792 · Cited by 317
Who Should Be Treated? Empirical Welfare Maximization Methods for Treatment Choice
Kitagawa, T., & Tetenov, A. (2018) · Econometrica · doi:10.3982/ecta13288 · Cited by 277
Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combination
Kallus, N., Mao, X., & Zhou, A. (2022) · Management Science · doi:10.1287/mnsc.2020.3850 · Cited by 93
Fair Regression with Wasserstein Barycenters
Chzhen, E., Denis, C., Hebiri, M., Oneto, L., & Pontil, M. (2020) · arXiv · doi:10.48550/arxiv.2006.07286 · Cited by 46
“We refer to [3, 15, 29, 30, 39] for various examples of estimators and additional assumptions such that the bound in Assumption 4.”
BackgroundResultInfluential
Metadata
- Authors
- Audibert, J.-Y., & Tsybakov, A. B.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2007-04-01
- Volume
- 35
- Issue
- 2
- Pages
- 608-633
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W1996437515
- Cited by
- 326
- References
- 26
- FWCI
- 7.81
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast learning rates for plug-in classifiers. https://app.cochat.ai/papers/10.1214/009053606000001217
- The paper
- Audibert, J.-Y., & Tsybakov, A. B. (2007). Fast learning rates for plug-in classifiers. The Annals of Statistics. https://doi.org/10.1214/009053606000001217
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.