Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
From MaRDI portal
Publication:3191471
DOI10.1093/biomet/asu027zbMath1334.60149arXiv1210.6703OpenAlexW2152607957MaRDI QIDQ3191471
Krzysztof Łatuszyński, Anthony J. T. Lee
Publication date: 2 October 2014
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6703
Markov chain Monte Carlogeometric ergodicityapproximate Bayesian computationlocal adaptationvariance bounding
Related Items (19)
Which ergodic averages have finite asymptotic variance? ⋮ The use of a single pseudo-sample in approximate Bayesian computation ⋮ An approximate likelihood perspective on ABC methods ⋮ Variance bounding of delayed-acceptance kernels ⋮ Coupling random inputs for parameter estimation in complex models ⋮ Stability of noisy Metropolis-Hastings ⋮ Geometric ergodicity of a more efficient conditional Metropolis-Hastings algorithm ⋮ Uniform Ergodicity of the Particle Gibbs Sampler ⋮ Approximate Bayesian Computation for a Class of Time Series Models ⋮ Sequential Monte Carlo as approximate sampling: bounds, adaptive resampling via \(\infty\)-ESS, and an application to particle Gibbs ⋮ On a generalization of the preconditioned Crank-Nicolson metropolis algorithm ⋮ Bayesian Synthetic Likelihood ⋮ Accelerating Bayesian Synthetic Likelihood With the Graphical Lasso ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards ⋮ Scalable Bayesian inference for the inverse temperature of a hidden Potts model ⋮ Anytime parallel tempering ⋮ Improving Approximate Bayesian Computation via Quasi-Monte Carlo ⋮ Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms ⋮ Comparison of Markov chains via weak Poincaré inequalities with application to pseudo-marginal MCMC
This page was built for publication: Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
