University of Cambridge > > Machine Learning @ CUED > Advanced MCMC Methods

Advanced MCMC Methods

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani.

Advanced Machine Learning Tutorial Lecture

Markov chain Monte Carlo (MCMC) algorithms draw correlated samples from probability distributions. These allow approximate computation of complex high-dimensional integrals; obvious applications include Bayesian statistics and statistical physics. This tutorial will not assume any prior knowledge of MCMC , but will cover state-of-the-art techniques.

Tentative Schedule:

  • Introduction: Metropolis—Hastings vs “simpler” Monte Carlo methods
  • Hamiltonian (Hybrid) Monte Carlo
  • Auxiliary variables and Slice sampling
  • Out of equilibrium: tempering/annealing and related advances.
  • Possibly a few words on infinite models and doubly-intractable distributions.

This talk is part of the Machine Learning @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity