Publication:2657933

DOI10.1214/19-AAP1552zbMATH Open1472.60118arXiv1807.05401MaRDI QIDQ2657933FDOQ2657933

Pierre Monmarché, Alain Durmus, Arnaud Guillin

Publication date: 18 March 2021

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1807.05401

zbMATH Keywords

simulated annealingMCMCcouplinggeometric ergodicitybouncy particle sampler

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm
• Simulation of nonhomogeneous poisson processes by thinning
• Exponential convergence of Langevin distributions and their discrete approximations
• Markov chains for exploring posterior distributions. (With discussion)
• Markov Chains and Stochastic Stability
• Analysis of a nonreversible Markov chain sampler.
• Geometric ergodicity of Metropolis algorithms
• Equation of State Calculations by Fast Computing Machines
• The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data
• The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
• Irreversible Monte Carlo algorithms for efficient sampling
• A Liapounov bound for solutions of the Poisson equation
• Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
• Coupling of multidimensional diffusions by reflection
• Yet Another Look at Harris’ Ergodic Theorem for Markov Chains
• Reflection couplings and contraction rates for diffusions
• A stochastic model related to the telegrapher's equation
• An introduction to MCMC for machine learning
• ON DIFFUSION BY DISCONTINUOUS MOVEMENTS, AND ON THE TELEGRAPH EQUATION
• Uniformly integrable operators and large deviations for Markov processes
• Confinement by biased velocity jumps: aggregation of \textit{Escherichia coli}
• Étude spectrale minutieuse de processus moins indécis que les autres
• Long time behavior of telegraph processes under convex potentials
• From Individual to Collective Behavior in Bacterial Chemotaxis
• Large deviations asymptotics and the spectral theory of multiplicatively regular Markov proces\-ses
• Rates of convergence for Gibbs sampling for variance component models
• Bounds on regeneration times and limit theorems for subgeometric Markov chains
• On coupling of Markov chains
• Uniform moderate deviations of functional empirical processes of Markov chains
• Piecewise deterministic simulated annealing
• A piecewise deterministic scaling limit of lifted Metropolis-Hastings in the Curie-Weiss model
• Piecewise deterministic Markov processes for scalable Monte Carlo on restricted domains
• Limit theorems for the zig-zag process
• Exact simulation of the jump times of a class of piecewise deterministic Markov processes
• Bayesian computation: a summary of the current state, and samples backwards and forwards
• Simulated annealing process in general state space
• Exponential ergodicity of the bouncy particle sampler
• Ergodicity of the zigzag process

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
• Title not available (Why is that?)
• 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
• On the gap between deterministic and probabilistic Lyapunov exponents for continuous-time linear systems
• Strong invariance principles for ergodic Markov processes
• Exponential ergodicity of the bouncy particle sampler
• 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)