Estimation of distributions, moments and quantiles in deconvolution problems
Peter Hall, Soumendra N. Lahiri

TL;DR
This paper investigates the estimation of distributions, moments, and quantiles in errors-in-variables problems, revealing intrinsic properties and convergence behaviors of estimators in deconvolution scenarios.
Contribution
It introduces and analyzes estimators for distributions, moments, and quantiles in deconvolution problems, highlighting their unexpected convergence properties.
Findings
Estimator convergence can be slower at the origin than elsewhere.
The properties hold for optimal estimators, not just specific methods.
Intrinsic characteristics of errors-in-variables problems affect estimation rates.
Abstract
When using the bootstrap in the presence of measurement error, we must first estimate the target distribution function; we cannot directly resample, since we do not have a sample from the target. These and other considerations motivate the development of estimators of distributions, and of related quantities such as moments and quantiles, in errors-in-variables settings. We show that such estimators have curious and unexpected properties. For example, if the distributions of the variable of interest, , say, and of the observation error are both centered at zero, then the rate of convergence of an estimator of the distribution function of can be slower at the origin than away from the origin. This is an intrinsic characteristic of the problem, not a quirk of particular estimators; the property holds true for optimal estimators.
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.
