Markov chain Monte Carlo
Content
- Metropolis–Hastings algorithm
Learning objectives
At the end of the chapter, students should be able to
- implement a Metropolis–Hastings algorithm to draw samples from the posterior
- use efficient proposals and tuning for MCMC
Readings
- Chapter 5 of the course notes
Complementary readings
Slides
View all slides in new window Download PDF of all slides
References
Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A., & Rubin, D. B. (2013). Bayesian data analysis (3rd ed.). Chapman; Hall/CRC. https://doi.org/10.1201/b16018
McElreath, R. (2020). Statistical rethinking: A Bayesian course with examples in R and STAN (2nd ed.). Chapman; Hall/CRC.
Neal, R. M. (2003). Slice sampling. The Annals of Statistics, 31(3), 705–767. https://doi.org/10.1214/aos/1056562461