DeepAI AI Chat
Log In Sign Up

Hypocoercivity of Piecewise Deterministic Markov Process-Monte Carlo

08/26/2018
by   Christophe Andrieu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/26/2018

Hypercoercivity of Piecewise Deterministic Markov Process-Monte Carlo

In this paper we derive spectral gap estimates for several Piecewise Det...
07/29/2020

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

We establish L^2-exponential convergence rate for three popular piecewis...
11/18/2020

Subgeometric hypocoercivity for piecewise-deterministic Markov process Monte Carlo methods

We extend the hypocoercivity framework for piecewise-deterministic Marko...
12/27/2020

Adaptive Schemes for Piecewise Deterministic Monte Carlo Algorithms

The Bouncy Particle sampler (BPS) and the Zig-Zag sampler (ZZS) are cont...
03/17/2020

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

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