Unbiased Smoothing using Particle Independent Metropolis-Hastings
arXiv:1902.01781
Abstract
We consider the approximation of expectations with respect to the distribution of a latent Markov process given noisy measurements. This is known as the smoothing problem and is often approached with particle and Markov chain Monte Carlo (MCMC) methods. These methods provide consistent but biased estimators when run for a finite time. We propose a simple way of coupling two MCMC chains built using Particle Independent Metropolis-Hastings (PIMH) to produce unbiased smoothing estimators. Unbiased estimators are appealing in the context of parallel computing, and facilitate the construction of confidence intervals. The proposed scheme only requires access to off-the-shelf Particle Filters (PF) and is thus easier to implement than recently proposed unbiased smoothers. The approach is demonstrated on a Lévy-driven stochastic volatility model and a stochastic kinetic model.
arXiv comment13 pages
Cited by in corpus (6)
- Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo
- Estimating Convergence of Markov chains with L-Lag Couplings
- Simulating Diffusion Bridges with Score Matching
- Maximal couplings of the Metropolis-Hastings algorithm
- Unbiased Gradient Estimation for Variational Auto-Encoders using Coupled Markov Chains
- Exact Convergence Rate Analysis of the Independent Metropolis-Hastings Algorithms