Quasi-Bayesian sequential deconvolution
Stefano Favaro, Sandra Fortini

TL;DR
This paper introduces a computationally efficient sequential deconvolution method using a quasi-Bayesian approach, suitable for streaming data, with proven asymptotic properties and empirical validation against existing methods.
Contribution
It develops a novel sequential density deconvolution technique based on quasi-Bayesian modeling, with theoretical guarantees and practical advantages for streaming data.
Findings
Sequential estimator is computationally efficient with constant cost.
Asymptotic Gaussian CLTs enable credible intervals and bands.
Method outperforms kernel and Bayesian nonparametric approaches in experiments.
Abstract
Density deconvolution deals with the estimation of the probability density function of a random signal from data observed with independent and known additive random noise. This is a classical problem in statistics, for which frequentist and Bayesian nonparametric approaches are available to estimate in static or batch domains. In this paper, we consider the problem of density deconvolution in a streaming or online domain, and develop a principled sequential approach to estimate . By relying on a quasi-Bayesian sequential (learning) model for the data, often referred to as Newton's algorithm, we obtain a sequential deconvolution estimate of that is of easy evaluation, computationally efficient, and with constant computational cost as data increase, which is desirable for streaming data. In particular, local and uniform Gaussian central limit theorems for…
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
TopicsFault Detection and Control Systems · Gaussian Processes and Bayesian Inference · Statistical Methods and Inference
