Change search
ReferencesLink to record
Permanent link

Direct link
The serial and parallel belief propagation algorithms
Chalmers University of Technology.
University of South Australia. (Institute for Telecommunications Research)ORCID iD: 0000-0001-7182-9543
2005 (English)In: 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, 729-733 p.Conference paper (Refereed)
Abstract [en]

It has been shown that the stable fixed points of belief propagation (BP) algorithms correspond to extrema of the Bethe free energy. In this paper, we describe the dual problem for the minimization of the Bethe free energy and solve it using simple nonlinear block Gauss-Seidel and Jacobi algorithms. The use of the nonlinear block Gauss-Seidel algorithm corresponds to serial scheduling for the BP algorithm. In addition, it is shown that applying the nonlinear block Jacobi algorithm on the dual of the Bethe free energy corresponds to the parallel BP algorithm.

Place, publisher, year, edition, pages
2005. 729-733 p.
National Category
URN: urn:nbn:se:kth:diva-62637ISI: 000234713800153OAI: diva2:480774
IEEE International Symposium on Information Theory. Adelaide, AUSTRALIA. SEP 04-09, 2005
QC 20120120Available from: 2012-01-19 Created: 2012-01-19 Last updated: 2012-01-20Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Rasmussen, Lars Kildehöj

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link