DMCA
The serial and parallel belief propagation algorithms
Cached
Download Links
| Venue: | in Proc. IEEE Intern. Symp. on Inform. Theory |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Tan_theserial,
author = {Peng Hui Tan and Lars K. Rasmussen},
title = {The serial and parallel belief propagation algorithms},
booktitle = {in Proc. IEEE Intern. Symp. on Inform. Theory},
year = {},
pages = {729}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract — 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. I.
Keyphrases
parallel belief propagation algorithm bethe free energy simple nonlinear block gauss-seidel nonlinear block jacobi algorithm serial scheduling bethe free energy corresponds parallel bp algorithm bp algorithm stable fixed point nonlinear block gauss-seidel algorithm corresponds dual problem jacobi algorithm belief propagation
