Is SP BP?
Ronghui Tu, Yongyi Mao, Jiying Zhao · IEEE Transactions on Information Theory · 2010
The survey propagation (SP) algorithm for solving$k$-SAT problems has been shown recently as an instance of the belief propagation (BP) algorithm. In this paper, we show that for general constraint-satisfaction problems, SP may not be reducible from BP. We also establish the conditions under which such a reduction is possible. Along our development, we present a unification of the existing SP algorithms in terms of a probabilistically interpretable iterative procedure — weighted probabilistic token passing.