Adaptive Metropolis–Hastings Sampling using Reversible Dependent Mixture Proposals

Minh-Ngoc Tran, Michael K. Pitt, Robert Kohn

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
207 Downloads (Pure)

Abstract

This article develops a general-purpose adaptive sampler that approximates the target density by a mixture of multivariate t densities. The adaptive sampler is based on reversible proposal distributions each of which has the mixture of multivariate t densities as its invariant density. The reversible proposals consist of a combination of independent and correlated steps that allow the sampler to traverse the parameter space efficiently as well as allowing the sampler to keep moving and locally exploring the parameter space. We employ a twochain
approach, in which a trial chain is used to adapt the proposal densities used in the main chain. Convergence of the main chain and a strong law of large numbers are proved under reasonable conditions, and without imposing a Diminishing Adaptation condition. The mixtures of multivariate t densities are fitted by an efficient Variational Approximation algorithm in which the number of components is determined automatically. The performance of the sampler is evaluated using simulated and real examples. Our autocorrelated framework
is quite general and can handle mixtures other than multivariate t.
Original languageEnglish
Pages (from-to)361–381
Number of pages20
JournalSTATISTICS AND COMPUTING
Volume26
Issue number1-2
Early online date18 Sept 2014
DOIs
Publication statusPublished - 1 Jan 2016

Fingerprint

Dive into the research topics of 'Adaptive Metropolis–Hastings Sampling using Reversible Dependent Mixture Proposals'. Together they form a unique fingerprint.

Cite this