Scalable MCMC

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

• Hong Ge, Jes Frellsen
• Thursday 07 May 2015, 15:00-16:30
• Engineering Department, CBL Room 438.

If you have a question about this talk, please contact Rowan McAllister.

In the talk we are going to review some recent approaches to scaling up MCMC to large data sets. We will cover approached based on both the Metropolis-Hastings algorithm and Hamiltonian Monte Carlo. Common for all the approached is that they make use of subsampling to cut the computation budget.

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

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge University Engineering Department Talks
• Cambridge talks
• Centre for Smart Infrastructure & Construction
• Chris Davis' list
• Computational Continuum Mechanics Group Seminars
• Engineering Department, CBL Room 438
• Featured lists
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Journal Clubs
• Inference Group Summary
• Information Engineering Division seminar list
• Interested Talks
• ML
• Machine Learning Reading Group
• Machine Learning Reading Group @ CUED
• Machine Learning Summary
• Quantum Matter Journal Club
• Required lists for MLG
• School of Technology
• Simon Baker's List
• TQS Journal Clubs
• Trust & Technology Initiative - interesting events
• bld31
• custom
• ndk22's list
• ob366-ai4er
• rp587
• yk373's list

Note that ex-directory lists are not shown.