We investigate the use of a certain class of functional inequalities knownas weak Poincaré inequalities to bound convergence of Markov chains toequilibrium. We show that this enables the straightforward and transparent derivation of subgeometric convergence bounds for methods such asthe Independent Metropolis–Hastings sampler and pseudo-marginal methodsfor intractable likelihoods, the latter being subgeometric in many practicalsettings. These results rely on novel quantitative comparison theorems between Markov chains. Associated proofs are simpler than those relying ondrift/minorisation conditions and the tools developed allow us to recover andfurther extend known results as particular cases. We are then able to providenew insights into th...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...
International audiencePoincaré inequalities are ubiquitous in probability and analysis and have vari...
Bayesian inference in the presence of an intractable likelihood function is computationally challeng...
Pseudo-marginal Markov chain Monte Carlo methods for sampling from intractable distributions have ga...
The pseudo-marginal algorithm is a variant of the Metropolis–Hastings algorithm which samples asympt...
We consider a pseudo-marginal Metropolis–Hastings kernel Pm that is constructed using an average of ...
We consider a pseudo-marginal Metropolis--Hastings kernel Pm that is constructed using an average of...
The pseudo-marginal Metropolis-Hastings approach is increasingly used for Bayesian inference in stat...
Approximate Bayesian computation (ABC) [11, 42] is a popular method for Bayesian inference involvin...
The Monte Carlo within Metropolis (MCwM) algorithm, interpreted as a perturbed Metropolis-Hastings (...
The pseudo-marginal algorithm is a variant of the Metropolis--Hastings algorithm which samples asymp...
Some analytic and probabilistic properties of the weak Poincare ́ inequality are obtained. In partic...
AbstractIn order to describe L2-convergence rates slower than exponential, the weak Poincaré inequal...
Approximate Monte Carlo algorithms are not uncommon these days, their applicability is related to th...
We extend the hypocoercivity framework for piecewise-deterministic Markov process (PDMP) Monte Carlo...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...
International audiencePoincaré inequalities are ubiquitous in probability and analysis and have vari...
Bayesian inference in the presence of an intractable likelihood function is computationally challeng...
Pseudo-marginal Markov chain Monte Carlo methods for sampling from intractable distributions have ga...
The pseudo-marginal algorithm is a variant of the Metropolis–Hastings algorithm which samples asympt...
We consider a pseudo-marginal Metropolis–Hastings kernel Pm that is constructed using an average of ...
We consider a pseudo-marginal Metropolis--Hastings kernel Pm that is constructed using an average of...
The pseudo-marginal Metropolis-Hastings approach is increasingly used for Bayesian inference in stat...
Approximate Bayesian computation (ABC) [11, 42] is a popular method for Bayesian inference involvin...
The Monte Carlo within Metropolis (MCwM) algorithm, interpreted as a perturbed Metropolis-Hastings (...
The pseudo-marginal algorithm is a variant of the Metropolis--Hastings algorithm which samples asymp...
Some analytic and probabilistic properties of the weak Poincare ́ inequality are obtained. In partic...
AbstractIn order to describe L2-convergence rates slower than exponential, the weak Poincaré inequal...
Approximate Monte Carlo algorithms are not uncommon these days, their applicability is related to th...
We extend the hypocoercivity framework for piecewise-deterministic Markov process (PDMP) Monte Carlo...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...
International audiencePoincaré inequalities are ubiquitous in probability and analysis and have vari...
Bayesian inference in the presence of an intractable likelihood function is computationally challeng...