Abstract
This tutorial provides an introduction to Bayesian modeling and Markov Chain Monte-Carlo (MCMC) algorithms including the Metropolis-Hastings, Gibbs sampling and Hamiltonian Monte-Carlo algorithms. We discuss some of the challenges associated with running MCMC including the important question of determining when convergence to stationarity has been achieved. Several applications of Bayesian modeling are also provided including the MRP approach to modeling election outcomes, topic modeling in machine learning, and large-scale optimization and code breaking. We also discuss the important problems of Bayesian model checking and selection and provide an introduction to empirical Bayesian models. In the appendices we briefly discuss: (i) other problems in Bayesian statistics including Bayesian approaches to constructing confidence intervals, hypothesis testing and decision theory, and (ii) the EM algorithm which relates to the block Gibbs sampling algorithm.

This publication has 24 references indexed in Scilit: