Survey Propagation as “Probabilistic Token Passing”

Authors:
Ronghui Tu;Yongyi Mao;Jiying Zhao
Affiliations:
-;-;-
Venue:
IEICE - Transactions on Information and Systems
Year:
2008

Citing 2
Cited 1

A new look at survey propagation and its generalizations

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory

Is SP BP?

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

In this paper, we present a clean and simple formulation of survey propagation (SP) for constraint-satisfaction problems as “probabilistic token passing”. The result shows the importance of extending variable alphabets to their power sets in designing SP algorithms.