Inverse statistical learning


Let (X,Y)∈X×Y be a random couple with unknown distribution P. Let G be a class of measurable functions and ℓ a loss function. The problem of statistical learning deals with the estimation of the Bayes: g∗=arg ming∈ GEPℓ(g,(X,Y)). In this paper, we study this problem when we deal with a contaminated sample (Z1,Y1),…,(Zn,Yn) of i.i.d. indirect observations. Each input Zi, i=1,…,n is distributed from a density Af, where A is a known compact linear operator and f is the density of the direct input X. We derive fast rates of convergence for the excess risk of empirical risk minimizers based on regularization methods, such as deconvolution kernel density estimators or spectral cut-off. These results are comparable to the existing fast rates in Koltchinskii (2006) for the direct case. It gives some insights into the effect of indirect measurements in the presence of fast rates of convergence

Similar works

Full text

thumbnail-image time updated on 11/11/2016View original full text link

This paper was published in Okina.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.