Jump Markov chains and rejection-free Metropolis algorithms
Jeffrey S. Rosenthal (),
Aki Dote,
Keivan Dabiri,
Hirotaka Tamura,
Sigeng Chen and
Ali Sheikholeslami
Additional contact information
Jeffrey S. Rosenthal: University of Toronto
Aki Dote: University of Toronto
Keivan Dabiri: University of Toronto
Hirotaka Tamura: Fujitsu Laboratories Ltd.
Sigeng Chen: University of Toronto
Ali Sheikholeslami: University of Toronto
Computational Statistics, 2021, vol. 36, issue 4, No 18, 2789-2811
Abstract:
Abstract 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 $$\times $$ × 4 Ising model, and to a pseudo-marginal MCMC algorithm.
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s00180-021-01095-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:compst:v:36:y:2021:i:4:d:10.1007_s00180-021-01095-2
Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2
DOI: 10.1007/s00180-021-01095-2
Access Statistics for this article
Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik
More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().