Inverse statistical learning

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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:. 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.

Cite

CITATION STYLE

APA

Loustau, S. (2013). Inverse statistical learning. Electronic Journal of Statistics, 7(1), 2065–2097. https://doi.org/10.1214/13-EJS838

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free