Peskun-Tierney ordering for Markov chain and process Monte Carlo: beyond the reversible scenario
arXiv:1906.06197
Abstract
Historically time-reversibility of the transitions or processes underpinning Markov chain Monte Carlo methods (MCMC) has played a key rôle 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.
arXiv comment38 pages
References in corpus (13)
- Rejection-free Monte-Carlo sampling for general potentials
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- The Penalty Method for Random Walks with Uncertain Energies
- Randomized Hamiltonian Monte Carlo
- A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms
- Improving the convergence of reversible samplers
- Compressible Generalized Hybrid Monte Carlo
- Improving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are Better
- Hamiltonian Monte Carlo Without Detailed Balance
- Extra Chance Generalized Hybrid Monte Carlo
- Eigenvalue analysis of an irreversible random walk with skew detailed balance conditions
- Comparison of asymptotic variances of inhomogeneous Markov chains with application to Markov chain Monte Carlo methods
- Generalized and hybrid Metropolis-Hastings overdamped Langevin algorithms