mlsanityData to 7 Oct 2026

Unbiased Smoothing using Particle Independent Metropolis-Hastings

arXiv 1902.01781 ↗First posted 5 Feb 2019stat.CO stat.ME stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

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'evy-driven stochastic volatility model and a stochastic kinetic model.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Feb 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 3; 2023: 0; 2024: 1.

6 papers.