We study a class of adaptive Markov Chain Monte Carlo (MCMC) processes which aim at behaving as an ``optimal'' target process via a learning procedure. We show, under appropriate conditions, that the adaptive MCMC chain and the ``optimal'' (nonadaptive) MCMC process share many asymptotic properties. The special case of adaptive MCMC algorithms governed by stochastic approximation is considered in details and we apply our results to the adaptive Metropolis algorithm of [Haario, Saksman, Tamminen].
No takes yet. Share an insight, caveat, or question.
Andrieu et al. (2007) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: