Binary Bouncy Particle Sampler

11/02/2017
by   Ari Pakman, et al.
0

The Bouncy Particle Sampler is a novel rejection-free non-reversible sampler for differentiable probability distributions over continuous variables. We generalize the algorithm to piecewise differentiable distributions and apply it to generic binary distributions using a piecewise differentiable augmentation. We illustrate the new algorithm in a binary Markov Random Field example, and compare it to binary Hamiltonian Monte Carlo. Our results suggest that binary BPS samplers are better for easy to mix distributions.

READ FULL TEXT
research
01/16/2020

A piecewise deterministic Monte Carlo method for diffusion bridges

We introduce the use of the Zig-Zag sampler to the problem of sampling o...
research
08/26/2018

Hypercoercivity of Piecewise Deterministic Markov Process-Monte Carlo

In this paper we derive spectral gap estimates for several Piecewise Det...
research
08/13/2018

Randomized Hamiltonian Monte Carlo as Scaling Limit of the Bouncy Particle Sampler and Dimension-Free Convergence Rates

The Bouncy Particle Sampler is a Markov chain Monte Carlo method based o...
research
09/03/2016

Stochastic Bouncy Particle Sampler

We introduce a novel stochastic version of the non-reversible, rejection...
research
06/24/2020

The Boomerang Sampler

This paper introduces the Boomerang Sampler as a novel class of continuo...
research
12/27/2020

Adaptive Schemes for Piecewise Deterministic Monte Carlo Algorithms

The Bouncy Particle sampler (BPS) and the Zig-Zag sampler (ZZS) are cont...
research
09/28/2021

Reversible Gromov-Monge Sampler for Simulation-Based Inference

This paper introduces a new simulation-based inference procedure to mode...

Please sign up or login with your details

Forgot password? Click here to reset