PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Sufficient conditions for convergence of loopy belief propagation
Joris Mooij and Bert Kappen
In: Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence (UAI-05) (2005) AUAI Press , Corvallis, Oregon , pp. 396-403.

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.
Postscript - Requires a viewer, such as GhostView
EPrint Type:Book Section
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:3217
Deposited By:Joris Mooij
Deposited On:20 January 2008