Non-reversible guided Metropolis-Hastings kernel

05/12/2020
by   Kengo Kamatani, et al.
0

We construct a non-reversible Metropolis-Hastings kernel as a multivariate extension of the guided-walk kernel proposed by Gustafson in 1998 by introducing a projection from state space to a locally compact topological group. As a by-product, we construct an efficient reversible Metropolis-Hastings kernel based on the Haar measure which is of interest in its own right. The proposed non-reversible kernel was 10-40 times better than the random-walk Metropolis kernel or the Hamiltonian Monte Carlo kernel for the Gaussian process classification example in terms of effective sample size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2022

Space-efficient Quantization Method for Reversible Markov Chains

In a seminal paper, Szegedy showed how to construct a quantum walk W(P) ...
research
11/11/2021

Haar-Weave-Metropolis kernel

Recently, many Markov chain Monte Carlo methods have been developed with...
research
07/16/2020

Computing the minimal rebinding effect for non-reversible processes

The aim of this paper is to investigate the rebinding effect, a phenomen...
research
04/22/2021

Explicit, time-reversible and symplectic integrator for Hamiltonians in isotropic uniformly curved geometries

The kinetic term of the N-body Hamiltonian system defined on the surface...
research
11/04/2019

Non-reversible jump algorithms for Bayesian nested model selection

Non-reversible Markov chain Monte Carlo methods often outperform their r...
research
11/06/2012

Random walk kernels and learning curves for Gaussian process regression on random graphs

We consider learning on graphs, guided by kernels that encode similarity...
research
03/21/2019

Irreversible Langevin MCMC on Lie Groups

It is well-known that irreversible MCMC algorithms converge faster to th...

Please sign up or login with your details

Forgot password? Click here to reset