The use of a single pseudo-sample in approximate Bayesian computation

DOI10.1007/s11222-016-9640-7zbMath1505.62074arXiv1404.6298OpenAlexW2962718473MaRDI QIDQ2361438

Yanyan Li

Publication date: 30 June 2017

Published in: Statistics and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05)

Related Items

Which ergodic averages have finite asymptotic variance? ⋮ An approximate likelihood perspective on ABC methods ⋮ Optimal scaling for the pseudo-marginal random walk Metropolis: insensitivity to the noise generating mechanism ⋮ A tutorial introduction to Bayesian inference for stochastic epidemic models using approximate Bayesian computation ⋮ Approximate Bayesian computation and simulation-based inference for complex stochastic epidemic models ⋮ Bayesian Synthetic Likelihood ⋮ Peskun-Tierney ordering for Markovian Monte Carlo: beyond the reversible scenario

Cites Work

• The pseudo-marginal approach for efficient Monte Carlo computations
• Establishing some order amongst exact approximations of MCMCs
• On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
• Approximate Bayesian computational methods
• Variance bounding Markov chains
• Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
• A note on Metropolis-Hastings kernels for general state spaces
• CLTs and asymptotic variance of time-sampled Markov chains
• On the efficiency of pseudo-marginal random walk Metropolis algorithms
• Conditional convex orders and measurable martingale couplings
• Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing
• BAYESIAN INFERENCE BASED ONLY ON SIMULATED LIKELIHOOD: PARTICLE FILTER ANALYSIS OF DYNAMIC ECONOMIC MODELS
• Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
• Particle Markov Chain Monte Carlo for Efficient Numerical Simulation
• Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator

This page was built for publication: The use of a single pseudo-sample in approximate Bayesian computation