English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

MPS-Authors
/persons/resource/persons84109

Nickisch,  H
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Seeger, M., & Nickisch, H. (2011). Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference. In G. Gordon, D. Dunson, & M. Dudik (Eds.), JMLR Workshop and Conference Proceedings (pp. 652-660). Cambridge, MA, USA: MIT Press.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-BC3C-F
Abstract
We propose a novel algorithm to solve the expectation propagation relaxation of Bayesian inference for continuous-variable graphical models. In contrast to most previous algorithms, our method is provably convergent. By marrying convergent EP ideas from (OpperWinther, 2005) with covariance decoupling techniques (WipfNagarajan, 2008; NickischSeeger, 2009), it runs at least an order of magnitude faster than the most common EP solver.