arXiv · 2501.16506
Quantifying the Speed-Up from Non-Reversibility in MCMC Tempering Algorithms
Abstract
We investigate the increase in efficiency of simulated and parallel tempering MCMC algorithms when using non-reversible updates to give them "momentum". By making a connection to a certain simple discrete Markov chain, we show that, under appropriate assumptions, the non-reversible algorithms still exhibit diffusive behaviour, just on a different time scale. We use this to argue that the optimally scaled versions of the non-reversible algorithms are indeed more efficient than the optimally scaled versions of their traditional reversible counterparts, but only by a modest speed-up factor of about 42%.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gareth O. Roberts, Jeffrey S. Rosenthal. 2025-01-27. Quantifying the Speed-Up from Non-Reversibility in MCMC Tempering Algorithms. https://arxiv.org/abs/2501.16506
Cite the original work for its findings. Save a collection to share your selection of sources.