Sufficient conditions for convergence of Loopy Belief Propagation
Artificial Intelligence
2012-07-09 v1
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.
Keywords
Cite
@article{arxiv.1207.1405,
title = {Sufficient conditions for convergence of Loopy Belief Propagation},
author = {Joris Mooij and Hilbert Kappen},
journal= {arXiv preprint arXiv:1207.1405},
year = {2012}
}
Comments
Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005)