ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ρ\rho) be the root of a tree, let u u denote the broadcast labeling on its vertices, and consider message-passing algorithms whose messages take values in an alphabet Σ\Sigma with ∣Σ∣=L|\Sigma|=L, where L>0L>0 is fixed. Reconstruction is the problem of estimating uρ u_\rho from the messages received at the root. Bounded-memory impossibility conjecture. For any fixed L>0L > 0, no message-passing algorithm on an alphabet of size LL can achieve the guarantee of the Kesten–Stigum threshold. In other words, there exists a fixed noise level ε(L)\varepsilon(L) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.