Direction-sweep Markov chains
Liang Qin, Philipp Hoellmer, Werner Krauth

TL;DR
This paper introduces a non-reversible, direction-sweep Markov chain Monte Carlo algorithm that modifies trajectories to potentially improve mixing times, with rigorous analysis and applications in physics simulations.
Contribution
It presents a novel direction-sweep MCMC method applicable to various chains, with rigorous analysis of its dynamics and potential for faster mixing.
Findings
Direction-sweep MCMC preserves the stationary distribution.
The algorithm creates long excursions and zigzags in trajectories.
Potential for shorter mixing times compared to random direction updates.
Abstract
We discuss a non-reversible, lifted Markov-chain Monte Carlo (MCMC) algorithm for particle systems in which the direction of proposed displacements is changed deterministically. This algorithm sweeps through directions analogously to the popular MCMC sweep methods for particle or spin indices. Direction-sweep MCMC can be applied to a wide range of original reversible or non-reversible Markov chains, such as the Metropolis algorithm or the event-chain Monte Carlo algorithm. For a single two-dimensional dipole, we consider direction-sweep MCMC in the limit where restricted equilibrium is reached among the accessible configurations before changing the direction. We show rigorously that direction-sweep MCMC leaves the stationary probability distribution unchanged, and that it profoundly modifies the Markov-chain trajectory. Long excursions, with persistent rotation in one direction,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models
