Bounded-memory impossibility conjecture for belief propagation reconstruction
Statement
Let ) be the root of a tree, let denote the broadcast labeling on its vertices, and consider message-passing algorithms whose messages take values in an alphabet with , where is fixed. Reconstruction is the problem of estimating from the messages received at the root. Bounded-memory impossibility conjecture. For any fixed , no message-passing algorithm on an alphabet of size can achieve the guarantee of the Kesten–Stigum threshold. In other words, there exists a fixed noise level such that reconstruction is information-theoretically possible but no such message-passing algorithm is asymptotically better than a random guess. This conjecture asserts that attaining the reconstruction threshold requires unbounded memory, ruling out any bounded-memory analogue of belief propagation.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.