A tutorial on adaptive MCMC
We review adaptive Markov chain Monte Carlo algorithms (MCMC) as a mean to optimise their performance. Using simple toy examples we review their theoretical underpinnings, and in particular show why adaptive MCMC algorithms might fail when some fundamental properties are not satisfied. This leads to guidelines concerning the design of correct algorithms. We then review criteria and the useful framework of stochastic approximation, which allows one to systematically optimise generally used criteria, but also analyse the properties of adaptive MCMC algorithms. We then propose a series of novel adaptive algorithms which prove to be robust and reliable in practice. These algorithms are applied to artificial and high dimensional scenarios, but also to the classic mine disaster dataset inference problem.
Keywords: Mcmc ; Adaptive MCMC ; Controlled Markov chain ; Stochastic approximation ; Chain Monte-Carlo ; Principal Component Analysis ; Stochastic-Approximation ; Proposal Distribution ; Metropolis Algorithm ; Varying Bounds ; Convergence ; Inference ; Models ; Regeneration
Record created on 2010-11-30, modified on 2016-08-09