Irreversible Monte Carlo algorithms for efficient sampling
From MaRDI portal
Publication:629029
Abstract: Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is sufficient but not necessary. We construct irreversible deformation of a given reversible algorithm capable of dramatic improvement of sampling from known distribution. Our transformation modifies transition rates keeping the structure of transitions intact. To illustrate the general scheme we design an Irreversible version of Metropolis-Hastings (IMH) and test it on example of a spin cluster. Standard MH for the model suffers from the critical slowdown, while IMH is free from critical slowdown.
Recommendations
Cites work
- scientific article; zbMATH DE number 1528424 (Why is no real title available?)
- Approximation algorithms for NP-hard problems.
- Cycle Representations of Markov Processes
- Equation of state calculations by fast computing machines
- Lifting Markov chains to speed up mixing
- Monte Carlo sampling methods using Markov chains and their applications
- Optimization by simulated annealing
- Statistical mechanics: Algorithms and computations. With CD-ROM.
- The Monte Carlo Method
Cited in
(34)- Improved estimation of relaxation time in nonreversible Markov chains
- Monte Carlo methods beyond detailed balance
- Speed up Zig-Zag
- Reducing rejection exponentially improves Markov chain Monte Carlo sampling
- The stochastic collocation Monte Carlo sampler: highly efficient sampling from ‘expensive’ distributions
- Geometric allocation approach for the transition kernel of a Markov chain
- Piecewise deterministic Markov processes for scalable Monte Carlo on restricted domains
- Variance reduction using nonreversible Langevin samplers
- Non-reversible Metropolis-Hastings
- Non-reversible Monte Carlo simulations of spin models
- Characterizing limits and opportunities in speeding up Markov chain mixing
- Structure preserving schemes for Fokker-Planck equations of irreversible processes
- Complexity of zigzag sampling algorithm for strongly log-concave distributions
- Geometric ergodicity of the bouncy particle sampler
- Large deviations for the skew-detailed-balance lifted-Markov processes to sample the equilibrium distribution of the Curie–Weiss model
- Improving the convergence of reversible samplers
- Dynamics of the two-dimensional directed Ising model in the paramagnetic phase
- Irreversible samplers from jump and continuous Markov processes
- Reversibility violation in the hybrid Monte Carlo algorithm
- On Irreversible Metropolis Sampling Related to Langevin Dynamics
- Peskun-Tierney ordering for Markovian Monte Carlo: beyond the reversible scenario
- Direction-sweep Markov chains
- A note on the polynomial ergodicity of the one-dimensional Zig-Zag process
- Graphical representations and worm algorithms for the \(O(N)\) spin model
- Kinetic walks for sampling
- Non-reversible guided Metropolis kernel
- The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
- On the convergence time of some non-reversible Markov chain Monte Carlo methods
- PDMP characterisation of event-chain Monte Carlo algorithms for particle systems
- Markov chain Monte Carlo and irreversibility
- Ergodicity of the zigzag process
- Sampling algorithms in statistical physics: a guide for statistics and machine learning
- Approximations of piecewise deterministic Markov processes and their convergence properties
- Numerical studies for an ab initio investigation into the Boltzmann prescription in statistical mechanics of large systems
This page was built for publication: Irreversible Monte Carlo algorithms for efficient sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629029)
