Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes

Max Hahn-Klimroth, Dominik Kaaser, Malin Rau

In the pooled data problem we are given $n$ agents with hidden state bits, either $0$ or $1$. The hidden states are unknown and can be seen as the underlying ground truth $\sigma$. To u…