Sufficient conditions for convergence of Loopy Belief Propagation

Add code
Jul 04, 2012
Joris Mooij, Hilbert Kappen
Figure 1 for Sufficient conditions for convergence of Loopy Belief Propagation
Figure 2 for Sufficient conditions for convergence of Loopy Belief Propagation

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

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.

* Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005)  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon