On explicit \(L^2\)-convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms (Q2135272)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7522875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On explicit \(L^2\)-convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms |
scientific article; zbMATH DE number 7522875 |
Statements
On explicit \(L^2\)-convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms (English)
0 references
6 May 2022
0 references
The authors establish \(L^2\)-exponential convergence rate for three popular piecewise deterministic Markov processes for sampling: the randomized Hamiltonian Monte Carlo method, the zigzag process and the bouncy particle sampler. \newline The analysis is based on a variational framework for hypocoercivity, which combines a Poincaré-type inequality in time-augmented state space and a standard \(L^2\) energy estimate.\newline Explicit convergence rate estimates are provided, which are more quantitative than the existing results.
0 references
convergence rate
0 references
hypocoercivity
0 references
piecewise deterministic Markov process
0 references
Poincaré-type inequality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8968976140022278
0 references
0.8386052250862122
0 references
0.8253797888755798
0 references
0.8203756809234619
0 references
0.8047389984130859
0 references