Improved Bounds and Algorithms for Sparsity-Constrained Group Testing

04/07/2020
by   Nelvin Tan, et al.
0

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data science, communications, and many more. Motivated by physical considerations, we consider a sparsity-based constrained setting (Gandikota et al., 2019) in which the testing procedure is subject to one of the following two constraints: items are finitely divisible and thus may participate in at most γ tests; or tests are size-constrained to pool no more than ρ items per test. While information-theoretic limits and algorithms are known for the non-adaptive setting, relatively little is known in the adaptive setting. We address this gap by providing an information-theoretic converse that holds even in the adaptive setting, as well as a near-optimal noiseless adaptive algorithm for γ-divisible items. In broad scaling regimes, our upper and lower bounds asymptotically match up to a factor of e. We also present a simple asymptotically optimal adaptive algorithm for ρ-sized tests. In addition, in the non-adaptive setting with γ-divisible items, we use the Definite Defectives (DD) decoding algorithm and study bounds on the required number of tests for vanishing error probability under the random near-constant test-per-item design. We show that the number of tests required can be significantly less than the Combinatorial Orthogonal Matching Pursuit (COMP) decoding algorithm, and is asymptotically optimal in broad scaling regimes.

READ FULL TEXT
research
04/07/2020

Near-Optimal Sparse Adaptive Group Testing

In group testing, the goal is to identify a subset of defective items wi...
research
01/11/2022

Performance Bounds for Group Testing With Doubly-Regular Designs

In the group testing problem, the goal is to identify a subset of defect...
research
06/01/2021

Fast Splitting Algorithms for Sparsity-Constrained and Noisy Group Testing

In group testing, the goal is to identify a subset of defective items wi...
research
02/15/2019

Group testing: an information theory perspective

The group testing problem concerns discovering a small number of defecti...
research
10/18/2017

Phase Transitions in the Pooled Data Problem

In this paper, we study the pooled data problem of identifying the label...
research
09/08/2023

Concomitant Group Testing

In this paper, we introduce a variation of the group testing problem cap...
research
05/09/2019

Learning Erdős-Rényi Random Graphs via Edge Detecting Queries

In this paper, we consider the problem of learning an unknown graph via ...

Please sign up or login with your details

Forgot password? Click here to reset