An Efficient Algorithm for Capacity-Approaching Noisy Adaptive Group Testing

11/07/2019
by   Jonathan Scarlett, et al.
0

In this paper, we consider the group testing problem with adaptive test designs and noisy outcomes. We propose a computationally efficient four-stage procedure with components including random binning, identification of bins containing defective items, 1-sparse recovery via channel codes, and a "clean-up" step to correct any errors from the earlier stages. We prove that the asymptotic required number of tests comes very close to the best known information-theoretic achievability bound (which is based on computationally intractable decoding), and approaches a capacity-based converse bound in the low-sparsity regime.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2018

Noisy Adaptive Group Testing: Bounds and Algorithms

The group testing problem consists of determining a small set of defecti...
research
08/28/2018

Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach

The group testing problem consists of determining a small set of defecti...
research
06/23/2021

Noisy Adaptive Group Testing via Noisy Binary Search

The group testing problem consists of determining a small set of defecti...
research
01/15/2018

Secure Adaptive Group Testing

Group Testing (GT) addresses the problem of identifying a small subset o...
research
06/02/2020

Non-Adaptive Group Testing in the Linear Regime: Strong Converse and Approximate Recovery

In this paper, we consider the non-adaptive group testing problem in the...
research
01/25/2021

On the binary adder channel with complete feedback, with an application to quantitative group testing

We determine the exact value of the optimal symmetric rate point in the ...
research
10/18/2017

Phase Transitions in the Pooled Data Problem

In this paper, we study the pooled data problem of identifying the label...

Please sign up or login with your details

Forgot password? Click here to reset