2019
DOI: 10.1007/s11222-019-09913-w
|View full text |Cite
|
Sign up to set email alerts
|

Coordinate sampler: a non-reversible Gibbs-like MCMC sampler

Abstract: We derive a novel non-reversible, continuous-time Markov chain Monte Carlo (MCMC) sampler, called Coordinate Sampler, based on a piecewise deterministic Markov process (PDMP), which is a variant of the Zigzag sampler of Bierkens et al. (2016). In addition to providing a theoretical validation for this new simulation algorithm, we show that the Markov chain it induces exhibits geometrical ergodicity convergence, for distributions whose tails decay at least as fast as an exponential distribution and at most as f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
16
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(16 citation statements)
references
References 24 publications
0
16
0
Order By: Relevance
“…( 2018 ), Bierkens et al. ( 2019 ), Wu and Robert ( 2020 ) and Power and Goldman ( 2019 ). In practice, the algorithms iterate persistent dynamics of the state variable with jumps to its direction at random event times.…”
Section: Introductionmentioning
confidence: 99%
“…( 2018 ), Bierkens et al. ( 2019 ), Wu and Robert ( 2020 ) and Power and Goldman ( 2019 ). In practice, the algorithms iterate persistent dynamics of the state variable with jumps to its direction at random event times.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years there has been substantial interest in using continuous-time piecewise-deterministic Markov processes (PDMPs), as the basis for Markov chain Monte Carlo (MCMC) algorithms. These ideas started in the statistical physics literature [21], and have led to a number of new MCMC algorithms such as the Bouncy Particle Sampler (BPS) [7], the Zig-Zag (ZZ) Process [4] and the Coordinate Sampler (CS) [26], amongst many others. See [16] and [24] for an introduction to the area.…”
Section: Introductionmentioning
confidence: 99%
“…3. The Coordinate Sampler [26] uses {±e i } d i=1 as its velocity space, equipped with the uniform measure, where e i is the i th coordinate vector. Bounce events again happen at rate λ(x, v) = v, −∇ log π(x) + .…”
mentioning
confidence: 99%
“…This PDMP is a particular case of the process driven by (1): for instance in [23], the jump rate is given by λ(x, v) = (v • ∇ x U (x)) + , where U is a potential, and at each jump, the velocity is reflected according to optical laws on the level set of U it has reached. Recently, a new model have been studied: in [25], Robert and Wu introduce the coordinate sample, which is a variant of the Zig-Zag process, since the velocity does not live in {−1, +1} d but in {e i , 1 ≤ i ≤ d} the canonical base of R d . For this process, only one component of the position evolves between the jumps.…”
Section: Introductionmentioning
confidence: 99%
“…In fact, almost all of the recent study in dimension d do this for the sampling. Let us refer to [5,6,7,8,13,15,23,25], where the authors want to sample from a distribution with a density proportional to e −U , where U is a potential on R d . For a jump rate λ and a jump kernel Q well chosen (with respect to U ), the PDMP converges towards the targeted distribution.…”
Section: Introductionmentioning
confidence: 99%