Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, October 27, 2023 4:00 pm - 5:00 pm EDT

David Sprott Distinguished Lecture by Jeffrey Rosenthal

Distinguished Lecture Series

Jeffrey Rosenthal
University of Toronto

Room: DC 1351

Speeding up Metropolis using Theorems

Markov chain Monte Carlo (MCMC) algorithms, such as the Metropolis algorithm, are designed to converge to complicated high-dimensional target distributions, to facilitate sampling.  The speed of this convergence is essential for practical use.  In this talk, we will present several theoretical results which can help improve the Metropolis algorithm's convergence speed.  Specific topics will include: diffusion limits, optimal scaling, optimal proposal shape, tempering, adaptive MCMC, the Containment property, and the notion of adversarial Markov chains.  The ideas will be illustrated using the simple graphical example available at  No particular background knowledge will be assumed.