Thursday, October 22, 2020 - 3:00pm
Virtual - Zoom link available to public audience upon request, please contact Yuan Zhang (yzhanghf@stat.osu.edu).
Title
Adaptive MCMC For Everyone
Speaker
Jeffrey Rosenthal, University of Toronto, Department of Statistics
Abstract
Markov chain Monte Carlo (MCMC) algorithms, such as the Metropolis Algorithm and the Gibbs Sampler, are an extremely useful and popular method of approximately sampling from complicated probability distributions. Adaptive MCMC attempts to automatically modify the algorithm while it runs, to improve its performance on the fly. However, such adaptation often destroys the ergodicity properties necessary for the algorithm to be valid. In this talk, we first illustrate MCMC algorithms using simple graphical examples. We then discuss adaptive MCMC, and present examples and theorems concerning its ergodicity and efficiency.