REVIEW 5 cited by
Improving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are Better
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
I show how any reversible Markov chain on a finite state space that is irreducible, and hence suitable for estimating expectations with respect to its invariant distribution, can be used to construct a non-reversible Markov chain on a related state space that can also be used to estimate these expectations, with asymptotic variance at least as small as that using the reversible chain (typically smaller). The non-reversible chain achieves this improvement by avoiding (to the extent possible) transitions that backtrack to the state from which the chain just came. The proof that this modification cannot increase the asymptotic variance of an MCMC estimator uses a new technique that can also be used to prove Peskun's (1973) theorem that modifying a reversible chain to reduce the probability of staying in the same state cannot increase asymptotic variance. A non-reversible chain that avoids backtracking will often take little or no more computation time per transition than the original reversible chain, and can sometime produce a large reduction in asymptotic variance, though for other chains the improvement is slight. In addition to being of some practical interest, this construction demonstrates that non-reversible chains have a fundamental advantage over reversible chains for MCMC estimation. Research into better MCMC methods may therefore best be focused on non-reversible chains.
Forward citations
Cited by 5 Pith papers
-
Relaxation times of non-reversible Markov processes
Singular-value gaps of generators and two-point motions control L2 relaxation of non-reversible Markov processes, yielding a proof of the Diaconis–Miclo square-root speedup for lifted walks plus sharp bounds for switc...
-
Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs
Replacing the target μ by a history-adjusted target μ(x/μ)^{-α} in any graph MCMC sampler gives O(1/α) variance reduction at constant per-step cost, and extends to non-reversible chains.
-
Optimizing Irreversible Perturbations of the Unadjusted Langevin Algorithm
Develops a constrained optimization framework for position-independent irreversible perturbations of ULA that yields an explicit optimal design accounting for both spectral-gap mixing and weighted jump-distance bias.
-
True Self-Avoiding Walk for Accelerating Markov-Chain Monte Carlo Integration
TSAW-modified MCMC on finite irreducible chains achieves almost sure integral estimation error O(sqrt(log t)/t), improving on standard t^{-1/2} rates.
-
Adaptive tuning of Hamiltonian Monte Carlo methods
ATune combines Gaussian theoretical analysis with burn-in simulation data to select system-specific splitting integrators and hyperparameter credible intervals for improved HMC stability and performance.
Discussion (0). Continue with ORCID to comment.