Geometric ergodicity of the bouncy particle sampler
From MaRDI portal
Publication:2657933
Abstract: The Bouncy Particle Sampler (BPS) is a Monte Carlo Markov Chain algorithm to sample from a target density known up to a multiplicative constant. This method is based on a kinetic piecewise deterministic Markov process for which the target measure is invariant. This paper deals with theoretical properties of BPS. First, we establish geometric ergodicity of the associated semi-group under weaker conditions than in [10] both on the target distribution and the velocity probability distribution. This result is based on a new coupling of the process which gives a quantitative minorization condition and yields more insights on the convergence. In addition, we study on a toy model the dependency of the convergence rates on the dimension of the state space. Finally, we apply our results to the analysis of simulated annealing algorithms based on BPS.
Recommendations
- Exponential ergodicity of the bouncy particle sampler
- Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates
- Adaptive schemes for piecewise deterministic Monte Carlo algorithms
- The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
- Polynomial convergence rates of piecewise deterministic Markov processes
Cites work
- scientific article; zbMATH DE number 635670 (Why is no real title available?)
- scientific article; zbMATH DE number 1834045 (Why is no real title available?)
- A Liapounov bound for solutions of the Poisson equation
- A piecewise deterministic scaling limit of lifted Metropolis-Hastings in the Curie-Weiss model
- A stochastic model related to the telegrapher's equation
- An introduction to MCMC for machine learning
- Analysis of a nonreversible Markov chain sampler.
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Bounds on regeneration times and limit theorems for subgeometric Markov chains
- Confinement by biased velocity jumps: aggregation of \textit{Escherichia coli}
- Coupling of multidimensional diffusions by reflection
- Detailed spectral study of processes that are less hesistent than others
- Equation of state calculations by fast computing machines
- Ergodicity of the zigzag process
- Exact simulation of the jump times of a class of piecewise deterministic Markov processes
- Exponential convergence of Langevin distributions and their discrete approximations
- Exponential ergodicity of the bouncy particle sampler
- From Individual to Collective Behavior in Bacterial Chemotaxis
- Geometric ergodicity of Metropolis algorithms
- Irreversible Monte Carlo algorithms for efficient sampling
- Large deviations asymptotics and the spectral theory of multiplicatively regular Markov proces\-ses
- Limit theorems for the zig-zag process
- Long time behavior of telegraph processes under convex potentials
- MCMC using Hamiltonian dynamics
- Markov Chains and Stochastic Stability
- Markov chains for exploring posterior distributions. (With discussion)
- ON DIFFUSION BY DISCONTINUOUS MOVEMENTS, AND ON THE TELEGRAPH EQUATION
- On coupling of Markov chains
- Piecewise deterministic Markov processes for scalable Monte Carlo on restricted domains
- Piecewise deterministic simulated annealing
- Rates of convergence for Gibbs sampling for variance component models
- Reflection couplings and contraction rates for diffusions
- Simulated annealing process in general state space
- Simulation of nonhomogeneous poisson processes by thinning
- Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
- The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
- The zig-zag process and super-efficient sampling for Bayesian analysis of big data
- Uniform moderate deviations of functional empirical processes of Markov chains
- Uniformly integrable operators and large deviations for Markov processes
- Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm
- Yet Another Look at Harris’ Ergodic Theorem for Markov Chains
Cited in
(20)- On explicit \(L^2\)-convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms
- Generalizing Parallel Replica Dynamics: Trajectory Fragments, Asynchronous Computing, and PDMPs
- Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates
- scientific article; zbMATH DE number 7387626 (Why is no real title available?)
- Weak error expansion of a numerical scheme with rejection for singular Langevin process
- Large deviations of empirical measures of diffusions in weighted topologies
- \(L^2\) hypocoercivity, deviation bounds, hitting times and Lyapunov functions
- Exact targeting of Gibbs distributions using velocity-jump processes
- Hypocoercivity of piecewise deterministic Markov process-Monte Carlo
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Estimating accuracy of the MCMC variance estimator: asymptotic normality for batch means estimators
- Adaptive schemes for piecewise deterministic Monte Carlo algorithms
- Exponential ergodicity of the bouncy particle sampler
- On the gap between deterministic and probabilistic Lyapunov exponents for continuous-time linear systems
- Strong invariance principles for ergodic Markov processes
- Piecewise deterministic Markov processes and their invariant measures
- PDMP characterisation of event-chain Monte Carlo algorithms for particle systems
- Ergodicity of the zigzag process
- Recent progress on limit theorems for large stochastic particle systems
- Approximations of piecewise deterministic Markov processes and their convergence properties
This page was built for publication: Geometric ergodicity of the bouncy particle sampler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657933)
