University of Cambridge > Talks.cam > Machine Learning @ CUED > Convex Variational Bayesian Inference for Large Scale Generalized Linear Models

  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

Convex Variational Bayesian Inference for Large Scale Generalized Linear Models

Download to your calendar using vCal

If you have a question about this talk, please contact Carl Edward Rasmussen .

Bayesian inference for most generalized linear models is analytically not tractable. We show that a well known variational relaxation leads to a convex problem for any log-concave model and provide a generic double loop algorithm for solving it on models with arbitrary super-Gaussian potentials. We iteratively decouple the criterion, so that most of the computational work is done by solving large linear systems, rendering our algorithm much faster than previously proposed solvers. We evaluate our method on problems of Bayesian active learning for large binary classification models.

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

Average on weekdays: 9201.11982434 kWh Webinar & FW11, Computer Laboratory, William Gates Building. Dr. Mira Phailbus talks about the education system in Pakistan

Other talks

Title tbc Tea and Coffee Break How Far Can Good Go Without God? The Limits of a Naturalistic Ethic Scientific Steering Committee meeting Kirk Public Lecture | A proxy window into the beautiful and challenging world of causal attribution Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning
 

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