Avoiding Random Walks
More sophisticated algorithms use some method of preventing the walker from doubling back. These algorithms may be harder to implement, but may exhibit faster convergence (i.e. fewer steps for an accurate result).
- Successive over-relaxation: A Monte Carlo version of this technique can be seen as a variation on Gibbs sampling; it sometimes avoids random walks.
- Hybrid Monte Carlo (HMC): Tries to avoid random walk behaviour by introducing an auxiliary momentum vector and implementing Hamiltonian dynamics where the potential energy function is the target density. The momentum samples are discarded after sampling. The end result of Hybrid MCMC is that proposals move across the sample space in larger steps and are therefore less correlated and converge to the target distribution more rapidly.
- Some variations on slice sampling also avoid random walks.
- Langevin MCMC and other methods that rely on the gradient (and possibly second derivative) of the log posterior avoid random walks by making proposals that are more likely to be in the direction of higher probability density.
Read more about this topic: Markov Chain Monte Carlo
Famous quotes containing the words avoiding, random and/or walks:
“So Sam enters the universe of sleep, a man who seeks to live in such a way as to avoid pain, and succeeds merely in avoiding pleasure. What a dreary compromise is life!”
—Norman Mailer (b. 1923)
“Novels as dull as dishwater, with the grease of random sentiments floating on top.”
—Italo Calvino (1923–1985)
“One must not forget that recovery is brought about not by the physician, but by the sick man himself. He heals himself, by his own power, exactly as he walks by means of his own power, or eats, or thinks, breathes or sleeps.”
—Georg Groddeck (1866–1934)