Non-asymptotic confidence intervals for MCMC in practice
From MaRDI portal
Publication:6237882
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov processes: estimation; hidden Markov models (62M05) Monte Carlo methods (65C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Abstract: Using concentration inequalities, we give non-asymptotic confidence intervals for estimates obtained by Markov chain Monte Carlo (MCMC) simulations, when using the approximation . To allow the application of non-asymptotic error bounds in practice, here we state bounds formulated in terms of the spectral properties of the chain and the properties of and propose estimators of the parameters appearing in the bounds, including the spectral gap, mixing time, and asymptotic variance. We introduce a method for setting the burn-in time and the initial distribution that is theoretically well-founded and yet is relatively simple to apply. We also investigate the estimation of via subsampling and by using parallel runs instead of a single run. Our results are applicable to both reversible and non-reversible Markov chains on discrete as well as general state spaces. We illustrate our methods by simulations for three examples of Bayesian inference in the context of risk models and clinical trials.
This page was built for publication: Non-asymptotic confidence intervals for MCMC in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237882)
