Skip to main content
Conference Proceedings

Sufficient conditions for convergence of Loopy Belief Propagation

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005 (2005) 396-403
32Citations
Citations of this article
55Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Mooij, J. M., & Kappen, H. J. (2005). Sufficient conditions for convergence of Loopy Belief Propagation. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005 (pp. 396–403). AUAI Press.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free