Sufficient Conditions for Convergence of the Sum–Product Algorithm

DOI10.1109/TIT.2007.909166zbMath1314.94112arXivcs/0504030OpenAlexW2167149929WikidataQ56431750 ScholiaQ56431750MaRDI QIDQ3549121

Joris M. Mooij, Hilbert J. Kappen

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0504030

zbMATH Keywords

convergenceContractionmessage passinggraphical modelsloopy belief propagationmarginalizationsum-product algorithmfactor graphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Decoding (94B35)

Related Items (7)

Find Your Place: Simple Distributed Algorithms for Community Detection ⋮ Step-by-step community detection in volume-regular graphs ⋮ Neural network implementation of inference on binary Markov random fields with probability coding ⋮ Latent binary MRF for online reconstruction of large scale systems ⋮ Diagonal stationary points of the Bethe functional ⋮ Convergence Analysis of Distributed Inference with Vector-Valued Gaussian Belief Propagation ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited

This page was built for publication: Sufficient Conditions for Convergence of the Sum–Product Algorithm