We develop an explore-exploit Markov chain Monte Carlo algorithm (Ex2MCMC) that combines multiple global proposals and mobile moves. The proposed method is massively parallelizable and extremely computationally efficient. We prove the V-uniform geometric ergodicity of Ex2MCMC under realistic conditions and compute explicit bounds on the mixing rate showing the improvement due to multiple global moves. We show that Ex2MCMC allows fine-tuning of exploitation (local moves) and exploration (global moves) via a novel approach to propose dependent global moves. Finally, we develop an adaptive scheme, FlEx2MCMC, that learns the distribution of global trains through normalizing flows.
We illustrate the efficiency of Ex2MCMC and its adaptive versions in many classical sampling benchmarks. We also show that these algorithms improve the quality of sampling GANs as energy-based models.
De Eero Simoncelli
De Naoki Saito
De Maarten de Hoop
De Martin Vetterli
De Maureen Clerc
De Irène Waldspurger
De Jérôme Kalifa
De Gitta Kutyniok
De Michael Unser
De Edouard Oyallon
De Remi Gribonval
De Ronnie Pavlov
De Viviane Pons
De Wolfgang Arendt
De David Hewett
