Publication

Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

Matthias Seeger
2011
Conference Papers

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 05) with covariance decoupling techniques (Wipf&Nagarajan 08, Nickisch&Seeger 09), it runs at least an order of magnitude faster than the most commonly used EP solver.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

Chat with Graph Search

Deciphering the nature of cell state transitions in single cells using quantitative modeling of temporal dynamics

Robust Outlier Rejection for 3D Registration with Variational Bayes

Analysis of a Class of Multilevel Markov Chain Monte Carlo Algorithms Based on Independent Metropolis–Hastings