English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

Seeger, M., & Nickisch, H. (2011). Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference. In 14th International Conference on Artificial Intelligence and Statistics (pp. 652-660).

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Seeger, M.1, Author
Nickisch, H.2, Author           
Affiliations:
1Max Planck Society, ou_persistent13              
2Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society, ou_1497647              

Content

show
hide
Free keywords: MPI für Intelligente Systeme; Abt. Schölkopf;
 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 (Opper&Winther, 2005) with covariance decoupling techniques (Wipf&Nagarajan, 2008; Nickisch&Seeger, 2009), it runs at least an order of magnitude faster than the most common EP solver.

Details

show
hide
Language(s):
 Dates: 2011-04-01
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: 14th International Conference on Artificial Intelligence and Statistics
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: 8 Volume / Issue: - Sequence Number: - Start / End Page: 652 - 660 Identifier: -