- Volume 24, Number 3 (2018), 1636-1652.
Optimal scaling of the independence sampler: Theory and practice
The independence sampler is one of the most commonly used MCMC algorithms usually as a component of a Metropolis-within-Gibbs algorithm. The common focus for the independence sampler is on the choice of proposal distribution to obtain an as high as possible acceptance rate. In this paper, we have a somewhat different focus concentrating on the use of the independence sampler for updating augmented data in a Bayesian framework where a natural proposal distribution for the independence sampler exists. Thus, we concentrate on the proportion of the augmented data to update to optimise the independence sampler. Generic guidelines for optimising the independence sampler are obtained for independent and identically distributed product densities mirroring findings for the random walk Metropolis algorithm. The generic guidelines are shown to be informative beyond the narrow confines of idealised product densities in two epidemic examples.
Bernoulli, Volume 24, Number 3 (2018), 1636-1652.
Received: November 2015
Revised: July 2016
First available in Project Euclid: 2 February 2018
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Lee, Clement; Neal, Peter. Optimal scaling of the independence sampler: Theory and practice. Bernoulli 24 (2018), no. 3, 1636--1652. doi:10.3150/16-BEJ908. https://projecteuclid.org/euclid.bj/1517540456