This is the authors' abstract. We don't add key points for this paper.
We derive sufficient conditions for the uniqueness of loopy belief propagation fixed points. These conditions depend on both the structure of the graph and the strength of the potentials and naturally extend those for convexity of the Bethe free energy. We compare them with (a strengthened version of) conditions derived elsewhere for pairwise potentials. We discuss possible implications for convergent algorithms, as well as for other approximate free energies.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Tom Heskes (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: