DocumentCode
2923436
Title
On the Interpretation of Survey Propagation
Author
Tu, Ronghui ; Mao, Yongyi ; Zhao, Jiying
Author_Institution
Ottawa Univ., Ottawa
fYear
2007
fDate
6-8 June 2007
Firstpage
77
Lastpage
80
Abstract
In this paper, we unify survey propagation (SP) for constraint-satisfaction problems as "probabilistic token passing" algorithms. We show that the reduction of SP from belief propagation (BP) for general problems requires a modification of the BP message-passing rule, namely, introducing what we call a state-decoupling operation on the BP messages. This raises a question mark on the recent "folk belief" that SP is BP.
Keywords
belief networks; computability; computational complexity; constraint theory; message passing; BP message-passing rule; belief propagation; constraint-satisfaction problem; folk belief; probabilistic token passing algorithm; state-decoupling operation; survey propagation; Algorithm design and analysis; Belief propagation; Channel coding; Heuristic algorithms; Information technology; Markov random fields; Physics; Source coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. CWIT '07. 10th Canadian Workshop on
Conference_Location
Edmonton, Alta.
Print_ISBN
1-4244-0769-9
Electronic_ISBN
1-4244-0769-9
Type
conf
DOI
10.1109/CWIT.2007.375705
Filename
4259759
Link To Document