Reducing rejection exponentially improves Markov chain Monte Carlo sampling
From MaRDI portal
Publication:6140171
DOI10.1016/J.PHYSA.2023.129368arXiv2208.03935OpenAlexW4388672943MaRDI QIDQ6140171FDOQ6140171
Authors: Hidemaro Suwa
Publication date: 19 January 2024
Published in: Physica A (Search for Journal in Brave)
Abstract: The choice of the transition kernel essentially determines the performance of the Markov chain Monte Carlo method. Despite the importance of kernel choice, guiding principles for optimal kernels have not been established. We here propose a rejection-controlling one-parameter transition kernel that can be applied to various Monte Carlo samplings and demonstrate that the rejection process plays a major role in determining the sampling efficiency. Varying the rejection probability, we study the autocorrelation time of the order parameter in the two- and three-dimensional ferromagnetic Potts models at the transition temperature. As the rejection rate is reduced, the autocorrelation time decreases exponentially in the sequential spin update and algebraically in the random spin update. The autocorrelation times of conventional algorithms almost fall on a single curve as a function of the rejection rate. The present transition kernel with an optimal parameter provides one of the most efficient samplers for general cases of discrete variables.
Full work available at URL: https://arxiv.org/abs/2208.03935
Cites Work
- Title not available (Why is that?)
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Equation of state calculations by fast computing machines
- Irreversible Monte Carlo algorithms for efficient sampling
- Title not available (Why is that?)
- A Guide to Monte Carlo Simulations in Statistical Physics
- Optimum Monte-Carlo sampling using Markov chains
- Three-dimensional 3-state Potts model revisited with new techniques
- Title not available (Why is that?)
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- Title not available (Why is that?)
- On the optimal transition matrix for Markov chain Monte Carlo sampling
- Order-\(n\) cluster Monte Carlo method for spin systems with long-range interactions
- Monte Carlo methods beyond detailed balance
- Non-reversible Monte Carlo simulations of spin models
- Geometric allocation approach for the transition kernel of a Markov chain
This page was built for publication: Reducing rejection exponentially improves Markov chain Monte Carlo sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140171)