PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Sufficient conditions for convergence of loopy belief propagation
Joris Mooij and Bert Kappen
In: Uncertainty in Artificial Intelligence, 26-29 July 2005, Toronto. Camada.

Abstract

We derive novel sufficient conditions for convergence of Loopy Belief Propagation (also known as the Sum-Product algorithm) to a unique fixed point. Our results improve upon previously known conditions. For binary variables with (anti-)ferromagnetic interactions, our conditions seem to be sharp.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:1859
Deposited By:Bert Kappen
Deposited On:29 November 2005