English
Related papers

Related papers: Infinite Dimensional Piecewise Deterministic Marko…

200 papers

Monte Carlo methods -- such as Markov chain Monte Carlo (MCMC) and piecewise deterministic Markov process (PDMP) samplers -- provide asymptotically exact estimators of expectations under a target distribution. There is growing interest in…

Computation · Statistics 2024-09-09 Adrien Corenflos , Matthew Sutton , Nicolas Chopin

This paper introduces the Boomerang Sampler as a novel class of continuous-time non-reversible Markov chain Monte Carlo algorithms. The methodology begins by representing the target density as a density, $e^{-U}$, with respect to a…

Computation · Statistics 2020-08-12 Joris Bierkens , Sebastiano Grazzi , Kengo Kamatani , Gareth Roberts

Piecewise deterministic Markov processes (PDMPs) are a type of continuous-time Markov process that combine deterministic flows with jumps. Recently, PDMPs have garnered attention within the Monte Carlo community as a potential alternative…

Methodology · Statistics 2024-10-23 Joris Bierkens , Kengo Kamatani , Gareth O. Roberts

There has been substantial interest in developing Markov chain Monte Carlo algorithms based on piecewise-deterministic Markov processes. However existing algorithms can only be used if the target distribution of interest is differentiable…

Statistics Theory · Mathematics 2021-11-12 Augustin Chevallier , Sam Power , Andi Q. Wang , Paul Fearnhead

In this work, we establish $\mathrm{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…

Computation · Statistics 2021-08-03 Christophe Andrieu , Alain Durmus , Nikolas Nüsken , Julien Roussel

Piecewise Deterministic Markov Processes (PDMPs) such as the Bouncy Particle Sampler and the Zig-Zag Sampler, have gained attention as continuous-time counterparts of classical Markov chain Monte Carlo. We study their transient regime under…

Computation · Statistics 2025-09-22 Sanket Agrawal , Joris Bierkens , Kengo Kamatani , Gareth O. Roberts

Piecewise deterministic Markov processes (PDMPs) are a class of stochastic processes with applications in several fields of applied mathematics spanning from mathematical modeling of physical phenomena to computational methods. A PDMP is…

Probability · Mathematics 2022-09-30 Andrea Bertazzi , Joris Bierkens , Paul Dobson

We show fundamental properties of the Markov semigroup of recently proposed MCMC algorithms based on Piecewise-deterministic Markov processes (PDMPs) such as the Bouncy Particle Sampler, the Zig-Zag process or the Randomized Hamiltonian…

Statistics Theory · Mathematics 2023-01-03 Peter Holderrieth

Novel Monte Carlo methods to generate samples from a target distribution, such as a posterior from a Bayesian analysis, have rapidly expanded in the past decade. Algorithms based on Piecewise Deterministic Markov Processes (PDMPs),…

Computation · Statistics 2022-09-05 Alice Corbella , Simon E F Spencer , Gareth O Roberts

The Bouncy Particle Sampler is a Markov chain Monte Carlo method based on a nonreversible piecewise deterministic Markov process. In this scheme, a particle explores the state space of interest by evolving according to a linear dynamics…

Computation · Statistics 2020-12-24 George Deligiannidis , Daniel Paulin , Alexandre Bouchard-Côté , Arnaud Doucet

Computing the volume of a polytope in high dimensions is computationally challenging but has wide applications. Current state-of-the-art algorithms to compute such volumes rely on efficient sampling of a Gaussian distribution restricted to…

Computation · Statistics 2022-02-22 Augustin Chevallier , Frédéric Cazals , Paul Fearnhead

Piecewise Deterministic Markov Processes (PDMPs) provide a powerful framework for continuous-time Monte Carlo, with the Bouncy Particle Sampler (BPS) as a prominent example. Recent advances through the Metropolised PDMP framework allow…

Computation · Statistics 2025-09-30 Augustin Chevallier , Erik Raab

Recent work has suggested using Monte Carlo methods based on piecewise deterministic Markov processes (PDMPs) to sample from target distributions of interest. PDMPs are non-reversible continuous-time processes endowed with momentum, and…

Machine Learning · Statistics 2024-06-28 Paul Fearnhead , Sebastiano Grazzi , Chris Nemeth , Gareth O. Roberts

Piecewise deterministic Markov processes (PDMPs) are a class of continuous-time Markov processes that were recently used to develop a new class of Markov chain Monte Carlo algorithms. However, the implementation of the processes is…

Computation · Statistics 2024-08-08 Charly Andral , Kengo Kamatani

Piecewise deterministic Markov processes are an important new tool in the design of Markov Chain Monte Carlo algorithms. Two examples of fundamental importance are the Bouncy Particle Sampler (BPS) and the Zig-Zag process (ZZ). In this…

Probability · Mathematics 2019-07-31 Joris Bierkens , Kengo Kamatani , Gareth O. Roberts

In this paper, we propose a novel class of Piecewise Deterministic Markov Processes (PDMPs) that are designed to sample from probability distributions $\pi$ supported on a convex set $\mathcal{M}$. This class of PDMPs adapts the concept of…

Computation · Statistics 2026-05-01 Joël Tatang Demano , Paul Dobson , Konstantinos Zygalakis

We develop a general framework for piecewise deterministic Markov process (PDMP) samplers that enables efficient Bayesian inference in non-linear inverse problems with expensive likelihoods. The key ingredient is a surrogate-assisted…

Piecewise-deterministic Markov process (PDMP) samplers constitute a state-of-the-art Markov chain Monte Carlo paradigm in Bayesian computation, with examples including the zig-zag and bouncy particle sampler (bps). Recent work on the…

Computation · Statistics 2026-03-10 Andrew Chin , Akihiko Nishimura

Recently non-reversible samplers based on simulating piecewise deterministic Markov processes (PDMPs) have shown potential for efficient sampling in Bayesian inference problems. However, there remains a lack of guidance on how to best…

Methodology · Statistics 2021-12-28 Matthew Sutton , Paul Fearnhead

A new class of Markov chain Monte Carlo (MCMC) algorithms, based on simulating piecewise deterministic Markov processes (PDMPs), have recently shown great promise: they are non-reversible, can mix better than standard MCMC algorithms, and…

Computation · Statistics 2020-10-23 Augustin Chevallier , Paul Fearnhead , Matthew Sutton
‹ Prev 1 2 3 10 Next ›