Lecture 27 - Sampling Methods

Objectives

• Recognize probabilistic programming.

• Identify the requirements of the Metropolis algorithm.

• Identify the requirements of the Metropolis-Hastings algorithm.

• Empirically assess the convergence of Metropolis-Hastings.

• Explain how Gibbs sampling enables us to sample hierarchical models.