Minimax fast rates for discriminant analysis with errors in variables

Abstract

The effect of measurement errors in discriminant analysis is investigated. Given observations $Z=X+\epsilon$, where $\epsilon$ denotes a random noise, the goal is to predict the density of $X$ among two possible candidates $f$ and $g$. We suppose that we have at our disposal two learning samples. The aim is to approach the best possible decision rule $G^{\star }$ defined as a minimizer of the Bayes risk. In the free-noise case $(\epsilon =0)$, minimax fast rates of convergence are well-known under the margin assumption in discriminant analysis (see \cite{mammen}) or in the more general classification framework (see \cite{tsybakov2004,AT}). In this paper we intend to establish similar results in the noisy case, i.e. when dealing with errors in variables. We prove minimax lower bounds for this problem and explain how can these rates be attained, using in particular an Empirical Risk Minimizer (ERM) method based on deconvolution kernel estimators.

References in corpus (6)

• 2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization
• Fast learning rates for plug-in classifiers
• Risk bounds for statistical learning
• On deconvolution with repeated measurements
• Goodness-of-fit testing and quadratic functional estimation from indirect observations
• Empirical risk minimization in inverse problems

Cited by in corpus (8)

• Probabilistic Random Forest: A machine learning algorithm for noisy datasets
• Anisotropic oracle inequalities in noisy quantization
• Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions
• An Analysis of Active Learning With Uniform Feature Noise
• The algorithm of noisy k-means
• Bandwidth selection in kernel empirical risk minimization via the gradient
• Estimation of convex supports from noisy measurements
• Noisy classification with boundary assumptions