University of Cambridge > Talks.cam > Machine Learning @ CUED > Fast Variational Inference in the Conjugate Exponential Family

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Fast Variational Inference in the Conjugate Exponential Family

Download to your calendar using vCal

If you have a question about this talk, please contact David Duvenaud .

We present a general method for deriving collapsed variational inference algorithms for probabilistic models in the conjugate exponential family. Our method unifies many existing approaches to collapsed variational inference. Our collapsed variational inference leads to a new lower bound on the marginal likelihood. We exploit the information geometry of the bound to derive much faster optimization methods based on conjugate gradients for these models. Our approach is very general and is easily applied to any model where the mean field update equations have been derived. Empirically we show significant speed-ups for probabilistic inference using our bound.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge University German Society Average on weekdays: 9169.40281501 kWh Ahmed Lecture

Other talks

Group Work Cambridge RNA Club - IN PERSON Security Cooperation within Government and between Governments Thelocactus Together Now: Cooperation and Collaboration in Social Art Practice Tea and Coffee Break
 

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