Fast Variational Inference in the Conjugate Exponential Family

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

• James Hensman, University of Sheffield
• Tuesday 26 March 2013, 14:00-15:00
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

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 Microsoft Research Machine Learning and Perception Seminars series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
• Cambridge University Engineering Department Talks
• Centre for Smart Infrastructure & Construction
• Featured lists
• Machine Learning Summary
• Methodology in design research
• Microsoft Research Cambridge, public talks
• Microsoft Research Machine Learning and Perception Seminars
• School of Technology
• de239's list
• engineering

Note that ex-directory lists are not shown.