The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Smooth discrimination analysis
Open accessAbstract
Discriminant analysis for two data sets in $\mathbb{R}^d$ with probability densities $f$ and $g$ can be based on the estimation of the set $G = \{x: f(x) \geq g(x)\}$. We consider applications where it is appropriate to assume that the region $G$ has a smooth boundary or belongs to another nonparametric class of sets. In particular, this assumption makes sense if discrimination is used as a data analytic tool. Decision rules based on minimization of empirical risk over the whole class of sets and over sieves are considered. Their rates of convergence are obtained. We show that these rules achieve optimal rates for estimation of $G$ and optimal rates of convergence for Bayes risks. An interesting conclusion is that the optimal rates for Bayes risks can be very fast, in particular, faster than the “parametric” root-$n$ rate. These fast rates cannot be guaranteed for plug-in rules.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
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
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
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
Self-citationApproximation and estimation bounds for artificial neural networks
Barron, A. R. (1994) · Machine Learning · doi:10.1007/bf00993164 · Cited by 399
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
Measuring Mass Concentrations and Estimating Density Contour Clusters-An Excess Mass Approach
Polonik, W. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324626 · Cited by 248
Excess Mass Estimates and Tests for Multimodality
Müller, D. W., & Sawitzki, G. (1991) · Journal of the American Statistical Association · doi:10.1080/01621459.1991.10475103 · Cited by 247
Estimation des densit�s: risque minimax
Bretagnolle, J., & Huber, C. (1979) · Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete · doi:10.1007/bf00535278 · Cited by 218
Rates of convergence for minimum contrast estimators
Birgé, L., & Massart, P. (1993) · Probability Theory and Related Fields · doi:10.1007/bf01199316 · Cited by 211
Cited by
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
Concentration Inequalities and Model Selection
(2007) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-48503-2 · Cited by 744
Optimal aggregation of classifiers in statistical learning
Tsybakov, A. B. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120131 · Cited by 582
Self-citationPerformance guarantees for individualized treatment rules
Qian, M., & Murphy, S. A. (2011) · The Annals of Statistics · doi:10.1214/10-aos864 · Cited by 444
Theory 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
Metadata
- Authors
- Mammen, E., & Tsybakov, A. B.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 1999-12-01
- Volume
- 27
- Issue
- 6
- Pages
- 1808-1829
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2049393399
- Cited by
- 377
- References
- 14
- FWCI
- 3.26
- 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: Smooth discrimination analysis. https://app.cochat.ai/papers/10.1214/aos/1017939240
- The paper
- Mammen, E., & Tsybakov, A. B. (1999). Smooth discrimination analysis. The Annals of Statistics. https://doi.org/10.1214/aos/1017939240
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.