LSB: Local Self-Balancing MCMC in Discrete Spaces

by   Emanuele Sansone, et al.
KU Leuven

Markov Chain Monte Carlo (MCMC) methods are promising solutions to sample from target distributions in high dimensions. While MCMC methods enjoy nice theoretical properties, like guaranteed convergence and mixing to the true target, in practice their sampling efficiency depends on the choice of the proposal distribution and the target at hand. This work considers using machine learning to adapt the proposal distribution to the target, in order to improve the sampling efficiency in the purely discrete domain. Specifically, (i) it proposes a new parametrization for a family of proposal distributions, called locally balanced proposals, (ii) it defines an objective function based on mutual information and (iii) it devises a learning procedure to adapt the parameters of the proposal to the target, thus achieving fast convergence and fast mixing. We call the resulting sampler as the Locally Self-Balancing Sampler (LSB). We show through experimental analysis on the Ising model and Bayesian networks that LSB is indeed able to improve the efficiency over a state-of-the-art sampler based on locally balanced proposals, thus reducing the number of iterations required to converge, while achieving comparable mixing performance.


page 8

page 14


A Neural Network MCMC sampler that maximizes Proposal Entropy

Markov Chain Monte Carlo (MCMC) methods sample from unnormalized probabi...

Informed proposals for local MCMC in discrete spaces

There is a lack of methodological results to design efficient Markov cha...

Optimal design of the Barker proposal and other locally-balanced Metropolis-Hastings algorithms

We study the class of first-order locally-balanced Metropolis–Hastings a...

Efficient Informed Proposals for Discrete Distributions via Newton's Series Approximation

Gradients have been exploited in proposal distributions to accelerate th...

On Sampling with Approximate Transport Maps

Transport maps can ease the sampling of distributions with non-trivial g...

Generating MCMC proposals by randomly rotating the regular simplex

We present the simplicial sampler, a class of parallel MCMC methods that...

Zonotope hit-and-run for efficient sampling from projection DPPs

Determinantal point processes (DPPs) are distributions over sets of item...

Please sign up or login with your details

Forgot password? Click here to reset