Pooled testing to isolate infected individuals
Matthew Aldridge

TL;DR
This paper explores optimized pooled testing strategies for identifying infected individuals under limited testing resources, considering both practical COVID-19 screening scenarios and theoretical models with perfect tests.
Contribution
It introduces new algorithms for pooled testing that outperform simple methods at low prevalence and high sensitivity, and provides novel mathematical results for theoretical models.
Findings
Simple algorithms can be improved at low prevalence and high sensitivity.
New mathematical insights are obtained for models with perfect tests.
Practical strategies are proposed for COVID-19 screening.
Abstract
The usual problem for group testing is this: For a given number of individuals and a given prevalence, how many tests T* are required to find every infected individual? In real life, however, the problem is usually different: For a given number of individuals, a given prevalence, and a limited number of tests T much smaller than T*, how can these tests best be used? In this conference paper, we outline some recent results on this problem for two models. First, the "practical" model, which is relevant for screening for COVID-19 and has tests that are highly specific but imperfectly sensitive, shows that simple algorithms can be outperformed at low prevalence and high sensitivity. Second, the "theoretical" model of very low prevalence with perfect tests gives interesting new mathematical results.
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.
