Convex Variational Bayesian Inference for Large Scale Generalized Linear Models

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

• Hannes Nickisch
• Thursday 27 August 2009, 11:00-12:00
• Engineering Department, CBL Room 438.

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:

• Seminar
• All Talks (aka the CURE list)
• Biology
• CBL important
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge Neuroscience Seminars
• Cambridge talks
• Chris Davis' list
• Creating transparent intact animal organs for high-resolution 3D deep-tissue imaging
• Engineering Department, CBL Room 438
• Featured lists
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Summary
• Information Engineering Division seminar list
• Interested Talks
• Joint Machine Learning Seminars
• Life Science
• Life Sciences
• ML
• Machine Learning @ CUED
• Machine Learning Summary
• Neuroscience
• Neuroscience Seminars
• Neuroscience Seminars
• Required lists for MLG
• Simon Baker's List
• Stem Cells & Regenerative Medicine
• Trust & Technology Initiative - interesting events
• bld31
• dh539
• ndk22's list
• ob366-ai4er
• rp587
• yk373's list

Note that ex-directory lists are not shown.