Local belief propagation optimality conjecture with noisy side information

At least 10 years old · documented by

Under the binary symmetric stochastic block model with α\alpha-noisy side information, let pGn(σ^BPt)p_{G_n}(\widehat{\sigma}_{\rm BP}^t) be the estimation accuracy of belief propagation after tt iterations and let pGn∗p_{G_n}^* be the optimal estimation accuracy. Local BP optimality conjecture.

lim⁡t→∞lim⁡n→∞pGn(σ^BPt)=lim sup⁡n→∞pGn∗\lim_{t \to \infty} \lim_{n \to \infty} p_{G_n}(\widehat{\sigma}_{\rm BP}^t )= \limsup_{n \to \infty}p_{G_n}^*

holds for all aa, bb, and α\alpha. This asserts that iterated local belief propagation achieves asymptotically optimal estimation accuracy for every parameter choice; the paper notes that it can prove the claim in certain regimes but leaves the general statement open.

References

Primary source

Elchanan Mossel and Jiaming Xu, “Local Algorithms for Block Models with Side Information”, arXiv:1508.02344 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.