Hypocoercivity of Piecewise Deterministic Markov Process-Monte Carlo

by   Christophe Andrieu, et al.

In this work, we establish L^2-exponential convergence for a broad class of Piecewise Deterministic Markov Processes recently proposed in the context of Markov Process Monte Carlo methods and covering in particular the Randomized Hamiltonian Monte Carlo, the Zig-Zag process and the Bouncy Particle Sampler. The kernel of the symmetric part of the generator of such processes is non-trivial, and we follow the ideas recently introduced by (Dolbeault et al., 2009, 2015) to develop a rigorous framework for hypocoercivity in a fairly general and unifying set-up, while deriving tractable estimates of the constants involved in terms of the parameters of the dynamics. As a by-product we characterize the scaling properties of these algorithms with respect to the dimension of classes of problems, therefore providing some theoretical evidence to support their practical relevance.



There are no comments yet.


page 1

page 2

page 3

page 4


Hypercoercivity of Piecewise Deterministic Markov Process-Monte Carlo

In this paper we derive spectral gap estimates for several Piecewise Det...

Cores for Piecewise-Deterministic Markov Processes used in Markov Chain Monte Carlo

This article provides a tool for the analysis of Piecewise-deterministic...

Subgeometric hypocoercivity for piecewise-deterministic Markov process Monte Carlo methods

We extend the hypocoercivity framework for piecewise-deterministic Marko...

On explicit L^2-convergence rate estimate for piecewise deterministic Markov processes

We establish L^2-exponential convergence rate for three popular piecewis...

PDMP Monte Carlo methods for piecewise-smooth densities

There has been substantial interest in developing Markov chain Monte Car...

Mixing Rates for Hamiltonian Monte Carlo Algorithms in Finite and Infinite Dimensions

We establish the geometric ergodicity of the preconditioned Hamiltonian ...

Efficient computation of the volume of a polytope in high-dimensions using Piecewise Deterministic Markov Processes

Computing the volume of a polytope in high dimensions is computationally...
This week in AI

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