On the uniqueness of loopy belief propagation fixed points.
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.
Heskes
Tom
T
SNN, University of Nijmegen, 6525 EZ Nijmegen, The Netherlands. tom@snn.kun.nl