University of Cambridge > Talks.cam > Machine Learning Journal Club > Sensible Priors for Sparse Bayesian Learning

Sensible Priors for Sparse Bayesian Learning

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

If you have a question about this talk, please contact Philip Sterne.

Journal Club on : “Sensible Priors for Sparse Bayesian Learning”.

Joaquin QuiƱonero Candela; Edward Snelson come to present this and for discussion.

Sparse Bayesian learning suffers from impractical, overconfident predictions where the uncertainty tends to be maximal around the observations. We propose an alternative treatment that breaks the rigidity of the implied prior through decorrelation, and consequently gives reasonable and intuitive error bars. The attractive computational efficiency is retained; learning leads to sparse solutions. An interesting by-product is the ability to model non-stationarity and input-dependent noise.

——— http://research.microsoft.com/research/pubs/view.aspx?tr_id=1364

This talk is part of the Machine Learning Journal Club series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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