Nonasymptotic bounds on the mean square error for MCMC estimates via renewal techniques
From MaRDI portal
Publication:5326129
Abstract: The Nummellin's split chain construction allows to decompose a Markov chain Monte Carlo (MCMC) trajectory into i.i.d. "excursions". RegenerativeMCMC algorithms based on this technique use a random number of samples. They have been proposed as a promising alternative to usual fixed length simulation [25, 33, 14]. In this note we derive nonasymptotic bounds on the mean square error (MSE) of regenerative MCMC estimates via techniques of renewal theory and sequential statistics. These results are applied to costruct confidence intervals. We then focus on two cases of particular interest: chains satisfying the Doeblin condition and a geometric drift condition. Available explicit nonasymptotic results are compared for different schemes of MCMC simulation.
Recommendations
- Nonasymptotic bounds on the estimation error of MCMC algorithms
- On the applicability of regenerative simulation in Markov chain Monte Carlo
- Exponential inequalities for unbounded functions of geometrically ergodic Markov chains: applications to quantitative error bounds for regenerative Metropolis algorithms
- Rigorous confidence bounds for MCMC under a geometric drift condition
- Regenerative Markov chain Monte Carlo for any distribution
Cites work
- scientific article; zbMATH DE number 193660 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- A New Approach to the Limit Theory of Recurrent Markov Chains
- A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling.
- A regeneration proof of the central limit theorem for uniformly ergodic Markov chains
- A splitting technique for Harris recurrent Markov chains
- Catalytic perfect simulation
- Explicit error bounds for lazy reversible Markov chain Monte Carlo
- Fixed Precision MCMC Estimation by Median of Products of Averages
- General state space Markov chains and MCMC algorithms
- Geometric ergodicity and hybrid Markov chains
- Geometric ergodicity of Gibbs and block Gibbs samplers for a hierarchical random effects model
- Gibbs sampling for a Bayesian hierarchical general linear model
- Hoeffding's inequality for uniformly ergodic Markov chains
- How to couple from the past using a read-once source of randomness
- MC's for MCMC'ists
- Markov chains and stochastic stability
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Nonasymptotic bounds on the estimation error of MCMC algorithms
- On Excess Over the Boundary
- On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors
- On the applicability of regenerative simulation in Markov chain Monte Carlo
- On the geometric ergodicity of Metropolis-Hastings algorithms
- On the geometric ergodicity of hybrid samplers
- On variance conditions for Markov chain CLTs
- Random generation of combinatorial structures from a uniform distribution
- Rates of convergence of the Hastings and Metropolis algorithms
- Regeneration in Markov Chain Samplers
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Rigorous confidence bounds for MCMC under a geometric drift condition
- Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
- V-subgeometric ergodicity for a Hastings-Metropolis algorithm
Cited in
(5)- Hit-and-run for numerical integration
- Error bounds of MCMC for functions with unbounded stationary variance
- Orlicz Integrability of Additive Functionals of Harris Ergodic Markov Chains
- Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm
- Nonasymptotic bounds on the estimation error of MCMC algorithms
This page was built for publication: Nonasymptotic bounds on the mean square error for MCMC estimates via renewal techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326129)