Particle-kernel estimation of the filter density in state-space models
Dan Crisan, Joaqu\'in M\'iguez

TL;DR
This paper develops a kernel-based method for estimating the posterior density in particle filters, providing convergence guarantees and applications such as MAP estimation and entropy calculation.
Contribution
It introduces a novel kernel-based approach for density estimation in particle filters with proven asymptotic convergence and error rates.
Findings
Convergence rates for density approximation errors are established.
Almost sure convergence of the estimated measures to the true posterior.
Applications include MAP estimation and entropy approximation.
Abstract
Sequential Monte Carlo (SMC) methods, also known as particle filters, are simulation-based recursive algorithms for the approximation of the a posteriori probability measures generated by state-space dynamical models. At any given time , a SMC method produces a set of samples over the state space of the system of interest (often termed "particles") that is used to build a discrete and random approximation of the posterior probability distribution of the state variables, conditional on a sequence of available observations. One potential application of the methodology is the estimation of the densities associated to the sequence of a posteriori distributions. While practitioners have rather freely applied such density approximations in the past, the issue has received less attention from a theoretical perspective. In this paper, we address the problem of constructing kernel-based…
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.
