Decoding From Pooled Data: Phase Transitions of Message Passing
From MaRDI portal
Abstract: We consider the problem of decoding a discrete signal of categorical variables from the observation of several histograms of pooled subsets of it. We present an Approximate Message Passing (AMP) algorithm for recovering the signal in the random dense setting where each observed histogram involves a random subset of entries of size proportional to n. We characterize the performance of the algorithm in the asymptotic regime where the number of observations tends to infinity proportionally to n, by deriving the corresponding State Evolution (SE) equations and studying their dynamics. We initiate the analysis of the multi-dimensional SE dynamics by proving their convergence to a fixed point, along with some further properties of the iterates. The analysis reveals sharp phase transition phenomena where the behavior of AMP changes from exact recovery to weak correlation with the signal as m/n crosses a threshold. We derive formulae for the threshold in some special cases and show that they accurately match experimental behavior.
Cited in
(7)- Decoding from pooled data: sharp information-theoretic bounds
- A Unifying Tutorial on Approximate Message Passing
- Optimal group testing
- Subquadratic non-adaptive threshold group testing
- Approximate message passing with rigorous guarantees for pooled data and quantitative group testing
- Noisy group testing via spatial coupling
- On a near-optimal and efficient algorithm for the sparse pooled data problem
This page was built for publication: Decoding From Pooled Data: Phase Transitions of Message Passing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611458)
