University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Sampling as Optimization

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Sampling as Optimization

Download to your calendar using vCal

If you have a question about this talk, please contact Robert Pinsler .

Sampling and optimization are often thought of as alternative methods for model fitting. In this meeting of the reading group, we summarize recent results that draw connections between sampling and optimization. The key result is the work of Jordan et al. (1998), which shows that the gradient flow of the Kullback-Leibler divergence in the space of measures follows the Fokker-Planck equation. This Fokker-Planck equation can then be recast as running Langevin dynamics in the space of model parameters. With this result established, we then discuss implications for discretization schemes, viewing SGD as approximate Bayesian inference, and models for which sampling can be faster than optimization.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on Saturdays: 7497.3030303 kWh Judge Business School, Keynes House 107 LG17, Faculty of Law, University of Cambridge, 10 West Road, Cambridge, CB3 9DZ

Other talks

Title to be confirmed TBC Dinner Cambridge RNA Club - IN PERSON Group Work Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity