Adaptive Markov chain Monte Carlo through regeneration
Gilks, Walter R., Roberts, Gareth O. and Sahu, Sujit K. (1998) Adaptive Markov chain Monte Carlo through regeneration. Journal of the American Statistical Association, 93, (443), 1045-1054.
Full text not available from this repository.
Markov chain Monte Carlo (MCMC) is used for evaluating expectations of functions of interest under a target distribution π. This is done by calculating averages over the sample path of a Markov chain having π as its stationary distribution. For computational efficiency, the Markov chain should be rapidly mixing. This sometimes can be achieved only by careful design of the transition kernel of the chain, on the basis of a detailed preliminary exploratory analysis of π, An alternative approach might be to allow the transition kernel to adapt whenever new features of π are encountered during the MCMC run. However, if such adaptation occurs infinitely often, then the stationary distribution of the chain may be disturbed. We describe a framework, based on the concept of Markov chain regeneration, which allows adaptation to occur infinitely often but does not disturb the stationary distribution of the chain or the consistency of sample path averages.
|Keywords:||adaptive method, bayesian inference, gibbs sampling, markov chain monte marlo, metropolis-hastings algorithm, mixing rate, regeneration, splitting|
|Subjects:||Q Science > QA Mathematics
H Social Sciences > HA Statistics
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Statistics
|Date Deposited:||11 May 2007|
|Last Modified:||06 Jun 2013 01:11|
|Contributors:||Gilks, Walter R. (Author)
Roberts, Gareth O. (Author)
Sahu, Sujit K. (Author)
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)