A mollifier approach to the deconvolution of probability densities

We use mollification to regularize the problem of deconvolution of random variables. This regularization method offers a unifying and generalizing framework in order to compare the benefits of various filter-type techniques like deconvolution kernels, Tikhonov or spectral cut- off methods. In particular, the mollifier approach allows to relax some restrictive assumptions required for the deconvolution kernels, and has better stabilizing properties compared to spectral cutoff or Tikhonov. We show that this approach achieves optimal rates of convergence both for finitely and infinitely smoothing convolution operators under Besov and Sobolev smoothness assumptions on the unknown probability density. The qualification can be arbitrarily high depending on the choice of the mollifier function. We propose an adaptive choice of the regularization parameter using the Lepskii method and we provide simulations to compare the finite sample properties of our estimator with respect to the well-known regularization methods.(This abstract was borrowed from another version of this item.)