Ex^2MCMC: Sampling through Exploration Exploitation

by   Evgeny Lagutin, et al.

We develop an Explore-Exploit Markov chain Monte Carlo algorithm (Ex^2MCMC) that combines multiple global proposals and local moves. The proposed method is massively parallelizable and extremely computationally efficient. We prove V-uniform geometric ergodicity of Ex^2MCMC under realistic conditions and compute explicit bounds on the mixing rate showing the improvement brought by the multiple global moves. We show that Ex^2MCMC allows fine-tuning of exploitation (local moves) and exploration (global moves) via a novel approach to proposing dependent global moves. Finally, we develop an adaptive scheme, FlEx^2MCMC, that learns the distribution of global moves using normalizing flows. We illustrate the efficiency of Ex^2MCMC and its adaptive versions on many classical sampling benchmarks. We also show that these algorithms improve the quality of sampling GANs as energy-based models.



There are no comments yet.


page 1

page 2

page 3

page 4


Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm

The present paper focuses on the problem of sampling from a given target...

In Search of Lost (Mixing) Time: Adaptive Markov chain Monte Carlo schemes for Bayesian variable selection with very large p

The availability of data sets with large numbers of variables is rapidly...

Exploiting Local Optimality in Metaheuristic Search

A variety of strategies have been proposed for overcoming local optimali...

Balancing Global Exploration and Local-connectivity Exploitation with Rapidly-exploring Random disjointed-Trees

Sampling efficiency in a highly constrained environment has long been a ...

Sampling from Discrete Energy-Based Models with Quality/Efficiency Trade-offs

Energy-Based Models (EBMs) allow for extremely flexible specifications o...

Geometric Representations of Random Hypergraphs

A parametrization of hypergraphs based on the geometry of points in R^d ...

Finite space Kantorovich problem with an MCMC of table moves

In Optimal Transport (OT) on a finite metric space, one defines a distan...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.