Conditional particle filters with diffuse initial distributions

06/26/2020
by   Santeri Karppinen, et al.
0

Conditional particle filters (CPFs) are powerful smoothing algorithms for general nonlinear/non-Gaussian hidden Markov models. However, CPFs can be inefficient or difficult to apply with diffuse initial distributions, which are common in statistical applications. We propose a simple but generally applicable auxiliary variable method, which can be used together with the CPF in order to perform efficient inference with diffuse initial distributions. The method only requires simulatable Markov transitions that are reversible with respect to the initial distribution, which can be improper. We focus in particular on random-walk type transitions which are reversible with respect to a uniform initial distribution (on some domain), and autoregressive kernels for Gaussian initial distributions. We propose to use on-line adaptations within the methods. In the case of random-walk transition, our adaptations use the estimated covariance and acceptance rate adaptation, and we detail their theoretical validity. We tested our methods with a linear-Gaussian random-walk model, a stochastic volatility model, and a stochastic epidemic compartment model with time-varying transmission rate. The experimental findings demonstrate that our method works reliably with little user specification, and can be substantially better mixing than a direct particle Gibbs algorithm that treats initial states as parameters.

READ FULL TEXT

page 4

page 11

page 14

research
02/24/2022

Robust random walk-like Metropolis-Hastings algorithms for concentrating posteriors

Motivated by Bayesian inference with highly informative data we analyze ...
research
08/23/2021

Conditional sequential Monte Carlo in high dimensions

The iterated conditional sequential Monte Carlo (i-CSMC) algorithm from ...
research
09/07/2022

Mixing time of random walk on dynamical random cluster

We study the mixing time of a random walker who moves inside a dynamical...
research
02/04/2014

Particle Metropolis adjusted Langevin algorithms for state space models

Particle MCMC is a class of algorithms that can be used to analyse state...
research
06/08/2023

A pseudo-reversible normalizing flow for stochastic dynamical systems with various initial distributions

We present a pseudo-reversible normalizing flow method for efficiently g...
research
02/12/2015

Spectral Sparsification of Random-Walk Matrix Polynomials

We consider a fundamental algorithmic question in spectral graph theory:...
research
02/02/2023

Unsupervised Learning of Sampling Distributions for Particle Filters

Accurate estimation of the states of a nonlinear dynamical system is cru...

Please sign up or login with your details

Forgot password? Click here to reset