Pseudo-extended Markov chain Monte Carlo
نویسندگان
چکیده
Sampling from the posterior distribution using Markov chain Monte Carlo (MCMC) methods can require an exhaustive number of iterations to fully explore the correct posterior. This is often the case when the posterior of interest is multi-modal, as the MCMC sampler can become trapped in a local mode for a large number of iterations. In this paper, we introduce the pseudo-extended MCMC method as an approach for improving the mixing of the MCMC sampler in complex posterior distributions. The pseudo-extended method augments the state-space of the posterior using pseudo-samples as auxiliary variables, where on the extended space, the MCMC sampler is able to easily move between the well-separated modes of the posterior. We apply the pseudo-extended method within an Hamiltonian Monte Carlo sampler, and show that by using the No U-turn algorithm (Hoffman and Gelman, 2014), our proposed sampler is completely tuning free. We compare the pseudo-extended method against wellknown tempered MCMC algorithms and show the advantages of the new sampler on a number of challenging examples from the statistics literature.
منابع مشابه
Markov Chain Monte Carlo Maximum Likelihood
Markov chain Monte Carlo (e. g., the Metropolis algorithm and Gibbs sampler) is a general tool for simulation of complex stochastic processes useful in many types of statistical inference. The basics of Markov chain Monte Carlo are reviewed, including choice of algorithms and variance estimation, and some new methods are introduced. The use of Markov chain Monte Carlo for maximum likelihood est...
متن کاملPseudo-Marginal Slice Sampling
Markov chain Monte Carlo (MCMC) methods asymptotically sample from complex probability distributions. The pseudo-marginal MCMC framework only requires an unbiased estimator of the unnormalized probability distribution function to construct a Markov chain. However, the resulting chains are harder to tune to a target distribution than conventional MCMC, and the types of updates available are limi...
متن کاملOle F . Christensen , Asger Hobolth and Jens L . Jensen : Pseudo - likelihood analysis of context - dependent codon substitution models
We consider Markov processes for coding DNA sequence evolution. In context dependent models the instantaneous substitution rate for a codon depends on the neighboring codons. This makes the model analytically intractable, and previously Markov chain Monte Carlo methods have been used for statistical inference. We introduce an approximative estimation method based on pseudo-likelihood that makes...
متن کامل