Multiplicative deconvolution under unknown error distribution
Sergio Brenner Miguel, Jan Johannes, Maximilian Siebel

TL;DR
This paper develops a fully data-driven method for nonparametric multiplicative deconvolution when the error distribution is unknown, using Mellin transforms and spectral regularization, with theoretical risk bounds and simulation validation.
Contribution
It introduces a novel estimation procedure combining Mellin transform estimation with spectral cut-off and data-driven parameter selection for unknown error distributions.
Findings
Achieves near-oracle risk bounds without prior error knowledge
Provides convergence rates under classical smoothness assumptions
Demonstrates effectiveness through simulation studies
Abstract
We consider a multiplicative deconvolution problem, in which the density or the survival function of a strictly positive random variable is estimated nonparametrically based on an i.i.d. sample from a noisy observation of . The multiplicative measurement error is supposed to be independent of . The objective of this work is to construct a fully data-driven estimation procedure when the error density is unknown. We assume that in addition to the i.i.d. sample from , we have at our disposal an additional i.i.d. sample drawn independently from the error distribution. The proposed estimation procedure combines the estimation of the Mellin transformation of the density and a regularisation of the inverse of the Mellin transform by a spectral cut-off. The derived risk bounds and oracle-type inequalities cover both - the estimation of the…
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.
Taxonomy
TopicsStatistical Methods and Inference · Machine Learning and Algorithms · Distributed Sensor Networks and Detection Algorithms
