Saved in:
Bibliographic Details
Main Authors: Rosenthal, J. S., Dote, A., Dabiri, K., Tamura, H., Chen, S., Sheikholeslami, A.
Format: Preprint
Published: 2019
Subjects:
Online Access:https://arxiv.org/abs/1910.13316
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909157906448384
author Rosenthal, J. S.
Dote, A.
Dabiri, K.
Tamura, H.
Chen, S.
Sheikholeslami, A.
author_facet Rosenthal, J. S.
Dote, A.
Dabiri, K.
Tamura, H.
Chen, S.
Sheikholeslami, A.
contents We consider versions of the Metropolis algorithm which avoid the inefficiency of rejections. We first illustrate that a natural Uniform Selection Algorithm might not converge to the correct distribution. We then analyse the use of Markov jump chains which avoid successive repetitions of the same state. After exploring the properties of jump chains, we show how they can exploit parallelism in computer hardware to produce more efficient samples. We apply our results to the Metropolis algorithm, to Parallel Tempering, to a Bayesian model, to a two-dimensional ferromagnetic 4 x 4 Ising model, and to a pseudo-marginal MCMC algorithm.
format Preprint
id arxiv_https___arxiv_org_abs_1910_13316
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle Jump Markov Chains and Rejection-Free Metropolis Algorithms
Rosenthal, J. S.
Dote, A.
Dabiri, K.
Tamura, H.
Chen, S.
Sheikholeslami, A.
Statistics Theory
We consider versions of the Metropolis algorithm which avoid the inefficiency of rejections. We first illustrate that a natural Uniform Selection Algorithm might not converge to the correct distribution. We then analyse the use of Markov jump chains which avoid successive repetitions of the same state. After exploring the properties of jump chains, we show how they can exploit parallelism in computer hardware to produce more efficient samples. We apply our results to the Metropolis algorithm, to Parallel Tempering, to a Bayesian model, to a two-dimensional ferromagnetic 4 x 4 Ising model, and to a pseudo-marginal MCMC algorithm.
title Jump Markov Chains and Rejection-Free Metropolis Algorithms
topic Statistics Theory
url https://arxiv.org/abs/1910.13316