On the Optimal Rates of Convergence for Nonparametric Deconvolution Problems
Fan, Jianqing
Ann. Statist., Tome 19 (1991) no. 1, p. 1257-1272 / Harvested from Project Euclid
Deconvolution problems arise in a variety of situations in statistics. An interesting problem is to estimate the density $f$ of a random variable $X$ based on $n$ i.i.d. observations from $Y = X + \varepsilon$, where $\varepsilon$ is a measurement error with a known distribution. In this paper, the effect of errors in variables of nonparametric deconvolution is examined. Insights are gained by showing that the difficulty of deconvolution depends on the smoothness of error distributions: the smoother, the harder. In fact, there are two types of optimal rates of convergence according to whether the error distribution is ordinary smooth or supersmooth. It is shown that optimal rates of convergence can be achieved by deconvolution kernel density estimators.
Publié le : 1991-09-14
Classification:  Deconvolution,  nonparametric density estimation,  estimation of distribution,  optimal rates of convergence,  kernel estimate,  Fourier transformation,  smoothness of error distributions,  62G05,  62C25
@article{1176348248,
     author = {Fan, Jianqing},
     title = {On the Optimal Rates of Convergence for Nonparametric Deconvolution Problems},
     journal = {Ann. Statist.},
     volume = {19},
     number = {1},
     year = {1991},
     pages = { 1257-1272},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176348248}
}
Fan, Jianqing. On the Optimal Rates of Convergence for Nonparametric Deconvolution Problems. Ann. Statist., Tome 19 (1991) no. 1, pp.  1257-1272. http://gdmltest.u-ga.fr/item/1176348248/