Minimax fast rates for discriminant analysis with errors in variables
From MaRDI portal
Publication:2345118
DOI10.3150/13-BEJ564zbMath1388.62188arXiv1201.3283MaRDI QIDQ2345118
Sébastien Loustau, Clément Marteau
Publication date: 19 May 2015
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.3283
Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items (6)
Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule ⋮ Noisy discriminant analysis with boundary assumptions ⋮ Inverse statistical learning ⋮ Optimal rates for regularization of statistical inverse learning problems ⋮ Bandwidth selection in kernel empirical risk minimization via the gradient ⋮ Estimation of convex supports from noisy measurements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing inverse problems: a direct or an indirect problem?
- On the optimal rates of convergence for nonparametric deconvolution problems
- Empirical risk minimization in inverse problems
- Risk bounds for statistical learning
- Deconvolution problems in nonparametric statistics
- Fast learning rates for plug-in classifiers
- Optimal plug-in estimators for nonparametric functional estimation
- Nonparametric regression with errors in variables
- Nonparametric estimators which can be ``plugged-in.
- Smooth discrimination analysis
- Optimal aggregation of classifiers in statistical learning.
- Weak convergence and empirical processes. With applications to statistics
- Penalized empirical risk minimization over Besov spaces
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- On deconvolution with repeated measurements
- Goodness-of-fit testing and quadratic functional estimation from indirect observations
- Empirical minimization
- Square root penalty: Adaption to the margin in classification and in edge estimation
- Local Rademacher complexities
- Theory of Classification: a Survey of Some Recent Advances
- Minimax nonparametric classification .I. Rates of convergence
- 10.1162/1532443041424337
- Nonparametric Prediction in Measurement Error Models
- Minimax Manifold Estimation
- Goodness-of-fit testing strategies from indirect observations
- Model selection and error estimation
This page was built for publication: Minimax fast rates for discriminant analysis with errors in variables