In a systematic Gibbs sampler for a standardized bivariate normal distribution with correlation , update conditionally on the old , then update using the new . Substitution gives the displayed autoregressive process of order one, with independent noises with the standard normal distribution . The sweep-to-sweep autocorrelation of at lag is , so the chain mixes slowly as approaches one.
For a standard bivariate normal distribution with correlation , each conditional has variance and mean times the other coordinate. A sweep draws , then . The resulting coordinate chain is an AR(1) process with coefficient and innovation variance . It shows explicitly why near-unit correlation slows successive Gibbs sweeps.
Software for Bayesian inference through Markov chain Monte Carlo in directed statistical models. Its model language uses
dnorm(mean, precision), so the second argument is inverse variance; dcat indexes a supplied probability vector, and dbern introduces a binary latent variable. The model is declarative, so the order of deterministic node definitions does not impose procedural evaluation order.For Gaussian precision , a systematic update of the first coordinate followed by the second makes the centered second coordinate an AR(1) chain with coefficient . Independent conditional Gaussian noise supplies its stable innovation. This proves convergence of the Gaussian Gibbs sampler and explains slower mixing when posterior correlation has magnitude near one.
Every full-conditional coordinate update satisfies detailed balance with the target distribution. Their systematic ordered composition preserves the target but need not satisfy detailed balance, since compositions of reversible kernels need not be reversible. A fixed-probability random-scan mixture remains reversible.
A blocked Gibbs sampler draws groups of coordinates jointly from their full conditional distributions. Each update preserves the joint probability distribution; dependence between blocks can still cause a long mixing time.
On a bipartite image graph, the pixels of one color are conditionally independent given the other color. Draw all black pixels from their independent full conditionals, then draw all whites conditional on the new blacks. Each color update preserves the target law, so their composition does too.
A random-scan Gibbs sampler chooses one coordinate, commonly uniformly at random, and redraws it from its complete conditional distribution while leaving all other coordinates fixed. Each coordinate update preserves the target distribution.
A single-coordinate Gibbs sampler update preserves the remaining coordinates and independently redraws the selected coordinate from its full conditional distribution. The joint measure of old and new states factors into a marginal and two identical conditional factors, making it symmetric. A fixed-probability mixture of such kernels therefore satisfies detailed balance.
A tempered Gibbs sampler changes the coordinate-selection probabilities and compensates by drawing from modified complete conditionals. Its invariant law can differ from the desired target, so expectations under the target are recovered with explicit importance weights.
For independent , a flat prior on , and an exponential prior of rate on , the full conditionals areandwhere the gamma distribution is parametrized by shape and rate.
Articles by others on the same topic
There are currently no matching articles.