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
- M. A. Sutton (ORCID: https://orcid.org/0000-0003-1900-2957)
- Nicolás Chopin (ORCID: https://orcid.org/0000-0002-0628-5815)
- Adrien Corenflos (ORCID: https://orcid.org/0000-0002-8374-4659)
Institutions
- The University of Queensland (AU)
- University of Warwick (GB)
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
- UK Research and Innovation