Decoding From Pooled Data: Phase Transitions of Message Passing

DOI10.1109/TIT.2018.2855698zbMATH Open1431.94015DBLPjournals/tit/AlaouiRKZJ19arXiv1702.02279OpenAlexW3101978115WikidataQ59460007 ScholiaQ59460007MaRDI QIDQ4611458FDOQ4611458

Authors: Aaditya Ramdas, Florent Krzakala, Lenka Zdeborová, Michael Jordan, Ahmed El Alaoui

Publication date: 18 January 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

m

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.

Full work available at URL: https://arxiv.org/abs/1702.02279

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Cited In (5)

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)