High-Dimensional Scaling of Piecewise Deterministic Monte Carlo

Efficiency Comparison & Asymptotic Variance Estimation

Hirofumi Shiba

Institute of Statistical Mathematics, Tokyo, Japan

6/16/2026

1 What is PDMP?

A PDMP: Forward Event-Chain Monte Carlo

1.1 Evolution of Markov Chain Monte Carlo

Markov Chain
(1953–)

Langevin Diffusion
(1978–)

PDMP
(2008–)

1.2 PDMP: Mathematical Definition

Langevin Diffusion

Randomized Hamiltonian Monte Carlo

1.3 Classical MCMC methods turn out to be PDMPs in disguise

Many PDMPs behave similarly in high dimensions.

RHMC (d=2)

discretized by symplectic integrator

O(d^{1.25}) complexity

BPS with Gaussian speed (d=10^3)

approximated by (random) piecewise linear interpolation

O(d^{1.5}) complexity

1.4 Digression: Killer applications of PDMP

x: CPU time, y: Estimate.(Bouchard-Côté et al., 2018)
Sparse Markov Random Field with d=10

Local Implementation O(d^1)

Exploiting sparsity, BPS atteins better scaling than HMC (MSE/sec.)

Stochastic Gradient O(n^0)

x: sample size n, y: log ESS
Logistic regression with d=16
Using an appropriate control variate, the efficiency of Zig-Zag is O(1)
in the limit of n\to\infty, it outperforms Langevin.

2 Towards Better Jump Strategy: A Scaling Analysis

We compare two famous PDMP methods under the following condition:

  • ODE: Fixed
  • Jump: Reflection + Refreshment vs. Combination
  • Target: High dimensional standard Gaussian

2.1 FECMC vs. BPS

Forward Event Chain Monte Carlo (Michel et al., 2020)

Bouncy Particle Sampler (Bouchard-Côté et al., 2018)

BPS with different hyperparameter \rho

2.2 Jump Strategy in FECMC vs. BPS

Stochastic Reflection

Reflection

Refreshment \rho

2.3 Empirical Comparison: BPS vs. FECMC

Effective Sample Size of U(x)=\|x\|^2, the negative log-density of 100 dimensional standard Gaussian, estimated over 1000 runs

2.4 Scaling Analysis = Deriving a Diffusion Limit

\text{Plotting } \textcolor{#0096FF}{Y_t^{(d)}}=\frac{\lvert\textcolor{#0096FF}{X}_{d\textcolor{#0096FF}{t}}^{\textcolor{#0096FF}{(d)}}\rvert^2-d}{\sqrt{d}} \text{ with } d=10^2,10^3,10^4:

2.5 Theorem 1: Diffusion Limits of FECMC & BPS

dY_t^{\textcolor{#0096FF}{\text{B}}}=-\frac{\sigma^2_{\textcolor{#0096FF}{\text{B}}}(\rho)}{4}Y_t^{\textcolor{#0096FF}{\text{B}}}\,dt+\sigma_{\textcolor{#0096FF}{\text{B}}}(\rho)\,dB_t \sigma^2_{\textcolor{#0096FF}{\text{B}}}(\rho)=8\int^\infty_0e^{-\rho s}\operatorname{E}[R_0^{\textcolor{#0096FF}{\text{B}}}R_s^{\textcolor{#0096FF}{\text{B}}}]\,ds

dY_t^{\textcolor{#E95420}{\text{F}}}=-\frac{\sigma^2_{\textcolor{#E95420}{\text{F}}}(\rho)}{4}Y_t^{\textcolor{#E95420}{\text{F}}}\,dt+\sigma_{\textcolor{#E95420}{\text{F}}}(\rho)\,dB_t \sigma^2_{\textcolor{#E95420}{\text{F}}}(\rho)=8\int^\infty_0e^{-\rho s}\operatorname{E}[R_0^{\textcolor{#E95420}{\text{F}}}R_s^{\textcolor{#E95420}{\text{F}}}]\,ds

2.6 Theorem 2: Analytic Expression of \sigma^2’s

While BPS atteins maximum at non-trivial value of \rho, FECMC achieves maximum at \rho=0

3 Asymptotic Variance / ESS Estimation for PDMP

Algorithmically, there is a fundamental difference between

\text{PDMP}\quad\widehat{h}_T^{\textcolor{#E95420}{\text{PDMP}}}=\frac{1}{T}\int^T_0h(\textcolor{#E95420}{X}_{\textcolor{#E95420}{t}}^{\textcolor{#E95420}{(d)}})\,dt, \text{classical MCMC}\quad\widehat{h}_N^{\textcolor{#0096FF}{\text{Classical MCMC}}}=\frac{1}{N}\sum_{n=1}^Nh(\textcolor{#0096FF}{X_n^{(d)}}).

Exploiting this continuous-time nature of PDMP, we can derive an efficient estimator for the asymptotic variance of \widehat{h}_T^{\textcolor{#E95420}{\text{PDMP}}}.

4 References

Bierkens, J., Fearnhead, P., and Roberts, G. (2019). The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data. The Annals of Statistics, 47(3), 1288–1320.
Bouchard-Côté, A., Vollmer, S. J., and Doucet, A. (2018). The Bouncy Particle Sampler: A Nonreversible Rejection-Free Markov Chain Monte Carlo Method. Journal of the American Statistical Association, 113(522), 855–867.
Michel, M., Durmus, A., and Sénécal, S. (2020). Forward event-chain monte carlo: Fast sampling by randomness control in irreversible markov chains. Journal of Computational and Graphical Statistics, 29(4), 689–702.