Ergodicity of Combocontinuous Adaptive MCMC Algorithms
This paper proves convergence to stationarity of certain adaptive MCMC algorithms, under certain assumptions including easily-verifiable upper and lower bounds on the transition densities and a continuous target density. In particular, the transition and proposal densities are not required to be continuous, thus improving on the previous ergodicity results of Craiu et al. (Ann Appl Probab 25(6):3592–3623, 2015).
KeywordsMarkov chain Monte Carlo Adaptive MCMC Ergodicity Dini’s theorem Piecewise continuous Combocontinuous
Mathematics Subject Classifications (2010)60J22 60J05 62M05
Unable to display preview. Download preview PDF.
We thank the anonymous reviewer for very helpful comments, which led to many improvements.
- Rosenthal JS (2004) Adaptive MCMC Java applet. http://probability.ca/jeff/java/adapt.html
- Tierney L (1994) Markov chains for exploring posterior distributions. Ann Stat 1701–1728Google Scholar
- Yang J (2016) Convergence and efficiency of adaptive MCMC. PhD thesis. Department of Statistical Sciences, University of Toronto. Unpublished thesisGoogle Scholar