English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

Seeger, M., & Nickisch, H.(2010). Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference. Tübingen, Germany: Max Planck Institute for Biological Cybernetics.

Item is

Files

show Files

Locators

show
hide
Locator:
https://arxiv.org/abs/1012.3584 (Any fulltext)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Seeger, M, Author           
Nickisch, H1, 2, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 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 (Opperamp;Winther 05) with covariance decoupling techniques (Wipfamp;Nagarajan 08, Nickischamp;Seeger 09), it runs at least an order of magnitude faster than the most commonly used EP solver.

Details

show
hide
Language(s):
 Dates: 2010-12
 Publication Status: Issued
 Pages: 16
 Publishing info: Tübingen, Germany : Max Planck Institute for Biological Cybernetics
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: 6995
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Technical Report of the Max Planck Institute for Biological Cybernetics
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -