Efficient Algorithms for Noisy Group Testing.

Group-testing refers to the problem of identifying (with high probability) a (small) subset of D defectives from a (large) set of N items via a “small” number of “pooled” tests (i.e., tests that have a positive outcome if at least one of the items being tested in the pool is defective, else have a negative outcome). For ease of presentation in this paper, we focus on the regime when D = \mathcal O(N^1- \delta ) for some \delta > 0 . The tests may be noiseless or noisy, and the testing procedure may be adaptive (the pool defining a test may depend on the outcome of a previous test), or non-adaptive (each test is performed independent of the outcome of other tests). A rich body of the literature demonstrates that \Theta (D\log (N)) tests are information-theoretically necessary and sufficient for the group-testing problem, and provides algorithms that achieve this performance. However, it is only recently that reconstruction algorithms with computational complexities that are sub-linear in N have started being investigated. In the scenario with adaptive tests with noisy outcomes, we present the first scheme that is simultaneously order-optimal (up to small constant factors) in both the number of tests and the decoding complexity ( \mathcal O\left (D\log (N)\right ) in both the performance metrics). The total number of stages of our adaptive algorithm is “small” ( \mathcal O\left (\log (D)\right ) ). Similarly, in the scenario with non-adaptive tests with noisy outcomes, we present the first scheme that is simultaneously near-optimal in both the number of tests and the decoding complexity (via an algorithm that requires \mathcal O\left (D\log (D)\log (N)\right ) tests and has a decoding complexity of \mathcal O(D(\log N+\log ^2D)) . Finally, we present an adaptive algorithm that only requires two stages, and for which both the number of tests and the decoding complexity scale as \mathcal O(D(\log N+\log ^2D)) . For all three settings, the probability of error of our algorithms scales as \mathcal O\left (1/(poly(D)\right ) . For each of the statements mentioned earlier about the order of the number of measurements, decoding complexity, and probability of error, we provide explicitly computed “small” universal factors in our theorem statements. [ABSTRACT FROM PUBLISHER]