Laplace deconvolution with noisy observations
Felix Abramovich, Marianna Pensky, Yves Rozenholc

TL;DR
This paper develops an asymptotically optimal and adaptive estimator for Laplace deconvolution with noisy discrete data, addressing a largely unexplored problem and demonstrating its effectiveness through theory and simulations.
Contribution
It introduces a new rate-optimal Laplace deconvolution estimator that adapts to unknown function regularity and handles increasing observation interval lengths.
Findings
Estimator is asymptotically minimax over Sobolev classes.
Simulation results confirm good finite-sample performance.
Method reduces deconvolution to nonparametric regression estimation.
Abstract
In the present paper we consider Laplace deconvolution for discrete noisy data observed on the interval whose length may increase with a sample size. Although this problem arises in a variety of applications, to the best of our knowledge, it has been given very little attention by the statistical community. Our objective is to fill this gap and provide statistical treatment of Laplace deconvolution problem with noisy discrete data. The main contribution of the paper is explicit construction of an asymptotically rate-optimal (in the minimax sense) Laplace deconvolution estimator which is adaptive to the regularity of the unknown function. We show that the original Laplace deconvolution problem can be reduced to nonparametric estimation of a regression function and its derivatives on the interval of growing length T_n. Whereas the forms of the estimators remain standard, the choices of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
