Accelerating MCMC by Rare Intermittent Resets

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a scheme for accelerating Markov Chain Monte Carlo by introducing random resets that become increasingly rare in a precise sense. We show that this still leads to the desired asymptotic average and establish an associated concentration bound. We show by numerical experiments that this scheme can be used to advantage in order to accelerate convergence by a judicious choice of the resetting mechanism.

Cite

CITATION STYLE

APA

Borkar, V. S., & Chaudhuri, S. (2021). Accelerating MCMC by Rare Intermittent Resets. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 404 LNICST, pp. 107–125). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-92511-6_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free