ML Anthology

Sufficient Conditions for Convergence of Loopy Belief Propagation

Joris M. Mooij, Hilbert J. Kappen
UAI 2005 pp. 396-403
/uai/2005/mooij2005uai-sufficient/

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.

UAI Semantic Scholar

Cite

Text

Mooij and Kappen. "Sufficient Conditions for Convergence of Loopy Belief Propagation." Conference on Uncertainty in Artificial Intelligence, 2005.

Markdown

[Mooij and Kappen. "Sufficient Conditions for Convergence of Loopy Belief Propagation." Conference on Uncertainty in Artificial Intelligence, 2005.](https://mlanthology.org/uai/2005/mooij2005uai-sufficient/)

BibTeX

@inproceedings{mooij2005uai-sufficient,
  title     = {{Sufficient Conditions for Convergence of Loopy Belief Propagation}},
  author    = {Mooij, Joris M. and Kappen, Hilbert J.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2005},
  pages     = {396-403},
  url       = {https://mlanthology.org/uai/2005/mooij2005uai-sufficient/}
}