Peskun-Tierney ordering for Markovian Monte Carlo: beyond the reversible scenario
From MaRDI portal
Publication:2054471
Abstract: Historically time-reversibility of the transitions or processes underpinning Markov chain Monte Carlo methods (MCMC) has played a key r^ole in their development, while the self-adjointness of associated operators together with the use of classical functional analysis techniques on Hilbert spaces have led to powerful and practically successful tools to characterize and compare their performance. Similar results for algorithms relying on nonreversible Markov processes are scarce. We show that for a type of nonreversible Monte Carlo Markov chains and processes, of current or renewed interest in the Physics and Statistical literatures, it is possible to develop comparison results which closely mirror those available in the reversible scenario. We show that these results shed light on earlier literature, proving some conjectures and strengthening some earlier results.
Recommendations
- Ordering and improving the performance of Monte Carlo Markov chains.
- An extension of Peskun and Tierney orderings to continuous time Markov chains
- Algorithms for improving efficiency of discrete Markov chains
- On the convergence time of some non-reversible Markov chain Monte Carlo methods
- scientific article; zbMATH DE number 1560252
Cites work
- scientific article; zbMATH DE number 3644239 (Why is no real title available?)
- scientific article; zbMATH DE number 425394 (Why is no real title available?)
- scientific article; zbMATH DE number 3062445 (Why is no real title available?)
- A Liapounov bound for solutions of the Poisson equation
- A function space HMC algorithm with second order Langevin diffusion limit
- A note on Metropolis-Hastings kernels for general state spaces
- A piecewise deterministic scaling limit of lifted Metropolis-Hastings in the Curie-Weiss model
- A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms
- An extension of Peskun and Tierney orderings to continuous time Markov chains
- Analysis of Boolean Functions
- Analysis of a nonreversible Markov chain sampler.
- Comparison of asymptotic variances of inhomogeneous Markov chains with application to Markov chain Monte Carlo methods
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Equation of state calculations by fast computing machines
- Establishing some order amongst exact approximations of MCMCs
- Extra chance generalized hybrid Monte Carlo
- Fluctuations in Markov processes. Time symmetry and martingale approximation.
- Free energy computations. A mathematical perspective
- Hypocoercivity of piecewise deterministic Markov process-Monte Carlo
- Improving the convergence of reversible samplers
- Irreversible Monte Carlo algorithms for efficient sampling
- Limit theorems for the zig-zag process
- Markov chain Monte Carlo and irreversibility
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Miscellanea. Peskun's theorem and a modified discrete-state Gibbs sampler
- Monte Carlo sampling methods using Markov chains and their applications
- Non-equilibrium thermodynamics of piecewise deterministic Markov processes
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- On random- and systematic-scan samplers
- On the perturbation theory for strongly continuous semigroups
- Optimum Monte-Carlo sampling using Markov chains
- Ordering and improving the performance of Monte Carlo Markov chains.
- Piecewise deterministic Markov processes for continuous-time Monte Carlo
- Pseudo-marginal Metropolis–Hastings sampling using averages of unbiased estimators
- Quantitative convergence rates for subgeometric Markov chains
- Randomized Hamiltonian Monte Carlo
- Spectral bounds for certain two-factor non-reversible MCMC algorithms
- The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
- The use of a single pseudo-sample in approximate Bayesian computation
- The zig-zag process and super-efficient sampling for Bayesian analysis of big data
- Time-reversal symmetry in dynamical systems: a survey
Cited in
(17)- An asymptotic Peskun ordering and its application to lifted samplers
- Hypocoercivity of piecewise deterministic Markov process-Monte Carlo
- Nonreversible Jump Algorithms for Bayesian Nested Model Selection
- Adaptive schemes for piecewise deterministic Monte Carlo algorithms
- Non-reversible processes: GENERIC, hypocoercivity and fluctuations
- A piecewise deterministic Monte Carlo method for diffusion bridges
- Non-reversible guided Metropolis kernel
- Variational formulas for asymptotic variance of general discrete-time Markov chains
- Sampling algorithms in statistical physics: a guide for statistics and machine learning
- Ordering and improving the performance of Monte Carlo Markov chains.
- Large deviations for the empirical measure of the zig-zag process
- Algorithms for improving efficiency of discrete Markov chains
- Automatic zig-zag sampling in practice
- Sticky PDMP samplers for sparse and local inference problems
- Infinite dimensional piecewise deterministic Markov processes
- An extension of Peskun and Tierney orderings to continuous time Markov chains
- Forward Event-Chain Monte Carlo: Fast Sampling by Randomness Control in Irreversible Markov Chains
This page was built for publication: Peskun-Tierney ordering for Markovian Monte Carlo: beyond the reversible scenario
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2054471)
