Abstract
We derive explicit asymptotic confidence intervals for any Markov chain Monte Carlo (MCMC) algorithm with finite asymptotic variance, started at any initial state, without requiring a Central Limit Theorem nor reversibility nor geometric ergodicity nor any bias bound. We also derive explicit non-asymptotic confidence intervals assuming bounds on the bias or first moment, or alternatively that the chain starts in stationarity. We relate those non-asymptotic bounds to properties of MCMC bias, and show that polynomially ergodicity implies certain bias bounds. We also apply our results to several numerical examples. It is our hope that these results will provide simple and useful tools for estimating errors of MCMC algorithms when CLTs are not available.
Highlights
Markov chain Monte Carlo (MCMC) is a very powerful tool for estimating and sampling from complicated high-dimensional distributions (see e.g. (Brooks, Gelman, Jones, & Meng, 2011) and the many references therein)
We derive explicit non-asymptotic confidence intervals assuming bounds on the bias or first moment, or alternatively that the chain starts in stationarity
It is our hope that these results will provide simple and useful tools for estimating errors of MCMC algorithms when Central Limit Theorem (CLT) are not available
Summary
Markov chain Monte Carlo (MCMC) is a very powerful tool for estimating and sampling from complicated high-dimensional distributions (see e.g. (Brooks, Gelman, Jones, & Meng, 2011) and the many references therein). The majority of the existing results for quantifying MCMC accuracy rely heavily on the Markov chain Central Limit Theorem (CLT) This CLT is only known to be valid under specific conditions like geometric ergodicity or reversibility, which do not always hold and can be difficult to verify Afterwards, the regeneration epochs are viewed as independent random variables in order to derive the confidence interval All of these methods require assumptions or calculations which can make them difficult to implement in practice.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Statistics and Probability
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
