Statistics – Computation
Scientific paper
2010-01-16
Statistics
Computation
Scientific paper
We consider various versions of adaptive Gibbs and Metropolis within-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.
Latuszynski Krzysztof
Rosenthal Jeffrey S.
No associations
LandOfFree
Adaptive Gibbs samplers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adaptive Gibbs samplers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Gibbs samplers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-88236