Noisy Adaptive Group Testing: Bounds and Algorithms
From MaRDI portal
Abstract: The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and many more. One of the defining features of the group testing problem is the distinction between the non-adaptive and adaptive settings: In the non-adaptive case, all tests must be designed in advance, whereas in the adaptive case, each test can be designed based on the previous outcomes. While tight information-theoretic limits and near-optimal practical algorithms are known for the adaptive setting in the absence of noise, surprisingly little is known in the noisy adaptive setting. In this paper, we address this gap by providing information-theoretic achievability and converse bounds under various noise models, as well as a slightly weaker achievability bound for a computationally efficient variant. These bounds are shown to be tight or near-tight in a broad range of scaling regimes, particularly at low noise levels. The algorithms used for the achievability results have the notable feature of only using two or three stages of adaptivity.
Cited in
(7)- A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
- Noise-Resilient Group Testing: Limitations and Constructions
- Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
- Optimal group testing
- Approximate message passing with rigorous guarantees for pooled data and quantitative group testing
- Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing
- Twenty questions with random error
This page was built for publication: Noisy Adaptive Group Testing: Bounds and Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224021)
