Accelerating pseudo-marginal Metropolis-Hastings by correlating auxiliary variables

11/17/2015
by   Johan Dahlin, et al.
0

Pseudo-marginal Metropolis-Hastings (pmMH) is a powerful method for Bayesian inference in models where the posterior distribution is analytical intractable or computationally costly to evaluate directly. It operates by introducing additional auxiliary variables into the model and form an extended target distribution, which then can be evaluated point-wise. In many cases, the standard Metropolis-Hastings is then applied to sample from the extended target and the sought posterior can be obtained by marginalisation. However, in some implementations this approach suffers from poor mixing as the auxiliary variables are sampled from an independent proposal. We propose a modification to the pmMH algorithm in which a Crank-Nicolson (CN) proposal is used instead. This results in that we introduce a positive correlation in the auxiliary variables. We investigate how to tune the CN proposal and its impact on the mixing of the resulting pmMH sampler. The conclusion is that the proposed modification can have a beneficial effect on both the mixing of the Markov chain and the computational cost for each iteration of the pmMH algorithm.

READ FULL TEXT
research
07/08/2016

Pseudo-Marginal Hamiltonian Monte Carlo

Bayesian inference in the presence of an intractable likelihood function...
research
07/17/2022

The Importance Markov Chain

The Importance Markov chain is a new algorithm bridging the gap between ...
research
10/06/2022

A correlated pseudo-marginal approach to doubly intractable problems

Doubly intractable models are encountered in a number of fields, e.g. so...
research
09/22/2017

Barker's algorithm for Bayesian inference with intractable likelihoods

In this expository paper we abstract and describe a simple MCMC scheme f...
research
05/19/2022

Continuously-Tempered PDMP Samplers

New sampling algorithms based on simulating continuous-time stochastic p...
research
08/30/2018

Accelerating Parallel Tempering: Quantile Tempering Algorithm (QuanTA)

Using MCMC to sample from a target distribution, π(x) on a d-dimensional...
research
10/30/2016

Auxiliary gradient-based sampling algorithms

We introduce a new family of MCMC samplers that combine auxiliary variab...

Please sign up or login with your details

Forgot password? Click here to reset