Deconvolution in unlinked linear models
Fadoua Balabdaoui, Antonio Di Noia, C\'ecile Durot

TL;DR
This paper introduces a novel nonparametric deconvolution method for unlinked linear models, achieving parametric convergence rates in Wasserstein distance regardless of noise smoothness.
Contribution
It combines unlinked regression with classical deconvolution, providing estimators for the distribution and densities of a latent linear function of covariates, with fast convergence guarantees.
Findings
Estimator achieves parametric rate in Wasserstein distance 1.
Proposed methods accurately estimate latent variable distributions.
Simulations confirm fast convergence and effective conditional estimation.
Abstract
Unlinked regression, in which covariates and responses are observed separately without known correspondence, has recently gained increasing attention. Deconvolution, on the other hand, is a fundamental and challenging problem in nonparametric statistics with the aim of estimating the distribution of a latent random variable based on observations contaminated by some additive noise. The complexity of this task is heavily influenced by the smoothness of the noise distribution and often leads to slow estimation rates. In this paper, we combine the recent unlinked linear regression problem with the classical deconvolution framework. Specifically, we study nonparametric deconvolution under the assumption that is a linear function of an observable multidimensional covariate. This structural constraint allows us to introduce a nonparametric estimator of the distribution of which…
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 · Random Matrices and Applications · Stochastic Gradient Optimization Techniques
