A guided walk Metropolis algorithm

@article{Gustafson1998AGW,
  title={A guided walk Metropolis algorithm},
  author={Paul Gustafson},
  journal={Statistics and Computing},
  year={1998},
  volume={8},
  pages={357-364}
}
The random walk Metropolis algorithm is a simple Markov chain Monte Carlo scheme which is frequently used in Bayesian statistical problems. We propose a guided walk Metropolis algorithm which suppresses some of the random walk behavior in the Markov chain. This alternative algorithm is no harder to implement than the random walk Metropolis algorithm, but empirical studies show that it performs better in terms of eciency and convergence time. 

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Ecient Metropolis jumping rules, in Bayesian Statistics

  • A. Gelman, G. Roberts, W Gilks
  • 1996
Highly Influential
8 Excerpts

Bayesian goodness of ®t testing using in®nite dimensional exponential families

  • Verdinelli, Wasserman
  • Annals of Statistics,
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…