Adaptive Gibbs samplers and related MCMC methods
نویسندگان
چکیده
We consider various versions of adaptive Gibbs and Metropoliswithin-Gibbs samplers, which update their selection probabilities (and perhaps also their proposal distributions) on the fly during a run, by learning as they go in an attempt to optimise the algorithm. We present a cautionary example of how even a simple-seeming adaptive Gibbs sampler may fail to converge. We then present various positive results guaranteeing convergence of adaptive Gibbs samplers under certain conditions. AMS 2000 subject classifications: Primary 60J05, 65C05; secondary 62F15.
منابع مشابه
Partially collapsed Gibbs sampling & path-adaptive Metropolis-Hastings in high-energy astrophysics
As the many examples in this book illustrate, Markov chain Monte Carlo (MCMC) methods have revolutionized Bayesian statistical analyses. Rather than using off-the-shelf models and methods, we can use MCMC to fit application specific models that are designed to account for the particular complexities of a problem at hand. These complex multilevel models are becoming more prevalent throughout the...
متن کاملConvergence of Adaptive Markov Chain Monte Carlo Algorithms
In the thesis, we study ergodicity of adaptive Markov Chain Monte Carlo methods (MCMC) based on two conditions (Diminishing Adaptation and Containment which together imply ergodicity), explain the advantages of adaptive MCMC, and apply the theoretical result for some applications. First we show several facts: 1. Diminishing Adaptation alone may not guarantee ergodicity; 2. Containment is not ne...
متن کاملAdaptive Metropolis-Hastings samplers for the Bayesian analysis of large linear Gaussian systems
This paper considers the implementation of efficient Bayesian computation for large linear Gaussian models containing many latent variables. A common approach is to implement a simple MCMC procedure such as the Gibbs sampler or data augmentation, but these methods are often unsatisfactory when the model is large. This motivates the need to develop other strategies for improving MCMC. This paper...
متن کاملGeometric Ergodicity of Gibbs Samplers
Due to a demand for reliable methods for exploring intractable probability distributions, the popularity of Markov chain Monte Carlo (MCMC) techniques continues to grow. In any MCMC analysis, the convergence rate of the associated Markov chain is of practical and theoretical importance. A geometrically ergodic chain converges to its target distribution at a geometric rate. In this dissertation,...
متن کاملMarginal Markov Chain Monte Carlo Methods
Marginal Data Augmentation and Parameter-Expanded Data Augmentation are related methods for improving the the convergence properties of the two-step Gibbs sampler know as the Data Augmentation sampler. These methods expand the parameter space with a so-callled working parameter that is unidentifiable given the observed data but is identifiable given the so-called augmented data. Although these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011