Group testing with nested pools
In\'es Armend\'ariz, Pablo A. Ferrari, Daniel Fraiman, Jos\'e M., Mart\'inez, Silvina Ponce Dawson

TL;DR
This paper analyzes optimal nested pooling strategies for group testing to efficiently identify infected individuals, providing explicit schemes and conjectures supported by numerical evidence, with costs approaching theoretical lower bounds.
Contribution
It characterizes the optimal nested pooling schemes for different infection probabilities and proposes a conjecture on the structure of these optimal schemes, supported by extensive numerical evidence.
Findings
Optimal schemes are among four explicitly described options.
Cost of best schemes scales as O(p log(1/p)), close to entropy bounds.
Conjecture on the structure of optimal schemes is supported by numerical evidence.
Abstract
In order to identify the infected individuals of a population, their samples are divided in equally sized groups called pools and a single laboratory test is applied to each pool. Individuals whose samples belong to pools that test negative are declared healthy, while each pool that tests positive is divided into smaller, equally sized pools which are tested in the next stage. In the -th stage all remaining samples are tested. If , we minimize the expected number of tests per individual as a function of the number of stages, and of the pool sizes in the first stages. We show that for each the optimal choice is one of four possible schemes, which are explicitly described. We conjecture that for each , the optimal choice is one of the two sequences of pool sizes , with a precise…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
