DeepAI AI Chat
Log In Sign Up

Quantitative Group Testing in the Sublinear Regime

by   Oliver Gebhard, et al.
University of Hamburg

The quantitative group testing (QGT) problem deals with efficiently identifying a small number of infected individuals among a large population. To this end, we can test groups of individuals where each test returns the total number of infected individuals in the tested pool. In line with literature on related inference problems, we consider the regime where the number of infected individuals is sublinear in the total population size. We derive a sharp information-theoretic threshold for the minimum number of tests required to identify the infected individuals with high probability. Such a threshold was so far only known for the case where the infected individuals are a constant fraction of the population (Alaoui et al. 2014, Scarlett & Cevher 2017). Moreover, we propose and analyze an efficient greedy reconstruction algorithm that outperforms the best known sublinear algorithm (Karimi et al. 2019) for certain sparsity regimes.


page 1

page 2

page 3

page 4


Information-theoretic and algorithmic thresholds for group testing

In the group testing problem we aim to identify a small number of infect...

Optimal non-adaptive group testing

In non-adaptive group testing we aim to identify a small set of k∼ n^θ i...

Extrapolating the profile of a finite population

We study a prototypical problem in empirical Bayes. Namely, consider a p...

Optimal group testing under real world restrictions

In the group testing problem one aims to infer a small set of k infected...

Detecting SNPs with interactive effects on a quantitative trait

Here we propose a test to detect effects of single nucleotide polymorphi...

Group design in group testing for COVID-19 : A French case-study

Group testing is a screening strategy that involves dividing a populatio...

Near-Optimal Pool Testing under Urgency Constraints

Detection of rare traits or diseases in a large population is challengin...