Pith. sign in

REVIEW 1 cited by

Speed Up Zig-Zag

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.16620 v2 pith:3DLUVTH6 submitted 2021-03-30 math.PR stat.CO

classification math.PRstat.CO
keywords processspeedzig-zagdeterministicfunctionheavysimulationsuzz
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Zig-Zag is Piecewise Deterministic Markov Process, efficiently used for simulation in an MCMC setting. As we show in this article, it fails to be exponentially ergodic on heavy tailed target distributions. We introduce an extension of the Zig-Zag process by allowing the process to move with a non-constant speed function $s$, depending on the current state of the process. We call this process Speed Up Zig-Zag (SUZZ). We provide conditions that guarantee stability properties for the SUZZ process, including non-explosivity, exponential ergodicity in heavy tailed targets and central limit theorem. Interestingly, we find that using speed functions that induce explosive deterministic dynamics may lead to stable algorithms that can even mix faster. We further discuss the choice of an efficient speed function by providing an efficiency criterion for the one-dimensional process and we support our findings with simulation results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Large sample scaling analysis of the Zig-Zag algorithm for Bayesian inference

    stat.CO 2024-11 conditional novelty 6.0 of 10

    For large datasets, the Zig-Zag sampler with control variates draws effectively independent posterior samples at O(1) cost per sample in stationarity, while vanilla sub-sampling and canonical Zig-Zag cost O(n).

Pith tools