Debiasing piecewise deterministic Markov process samplers using couplings

Abstract 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 alternatives to this asymptotic regime, in particular in constructing estimators that are exact in the limit of an infinite number of computing processors, rather than in the limit of an infinite number of Markov iterations. In particular, coupled MCMC estimators remove the non‐asymptotic bias, resulting in MCMC estimators that can be embarrassingly parallelized. In this work, we extend these estimators to the continuous‐time context and derive couplings for the bouncy, the boomerang, and the coordinate samplers. Some preliminary empirical results are included that demonstrate the reasonable scaling of our method with the dimension of the target.

Authors

Institutions

Publication Details

Journal
Scandinavian Journal of Statistics
Published
2025-09-04
DOI
https://doi.org/10.1111/sjos.70015
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Debiasing piecewise deterministic Markov process samplers using couplings

M. A. Sutton, Nicolás Chopin, Adrien Corenflos
Scandinavian Journal of Statistics
Markov Chains and Monte Carlo Methods
article

Debiasing piecewise deterministic Markov process samplers using couplings

M. A. Sutton, Nicolás Chopin, Adrien Corenflos
article en

Abstract

Abstract 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 alternatives to this asymptotic regime, in particular in constructing estimators that are exact in the limit of an infinite number of computing processors, rather than in the limit of an infinite number of Markov iterations. In particular, coupled MCMC estimators remove the non‐asymptotic bias, resulting in MCMC estimators that can be embarrassingly parallelized. In this work, we extend these estimators to the continuous‐time context and derive couplings for the bouncy, the boomerang, and the coordinate samplers. Some preliminary empirical results are included that demonstrate the reasonable scaling of our method with the dimension of the target.

Scandinavian Journal of StatisticsVol. 52(4)
The University of Queensland (AU), University of Warwick (GB)
UK Research and Innovation
Openalex Percentile: Top 77%
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.