Non-adaptive group testing: Explicit bounds and novel algorithms

We present computationally efficient and provably correct algorithms with near-optimal sample-complexity for noisy non-adaptive group testing. Group testing involves grouping arbitrary subsets of items into pools. Each pool is then tested to identify the defective items, which are usually assumed to be sparsely distributed. We consider random non-adaptive pooling where pools are selected randomly and independently of the test outcomes. Our noisy scenario accounts for both false negatives and false positives for the test outcomes. Inspired by compressive sensing algorithms we introduce four novel computationally efficient decoding algorithms for group testing, CBP via Linear Programming (CBP-LP), NCBP-LP (Noisy CBP-LP), and the two related algorithms NCBP-SLP+ and NCBP-SLP- (“Simple” NCBP-LP). The first of these algorithms deals with the noiseless measurement scenario, and the next three with the noisy measurement scenario. We derive explicit sample-complexity bounds - with all constants made explicit - for these algorithms as a function of the desired error probability; the noise parameters; the number of items; and the size of the defective set (or an upper bound on it). We show that the sample-complexities of our algorithms are near-optimal with respect to known information-theoretic bounds.

[1]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[2]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[3]  George Atia,et al.  Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.

[4]  Frank K. Hwang,et al.  A survey on nonadaptive group testing algorithms through the angle of decoding , 2008, J. Comb. Optim..

[5]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[6]  E. Gilbert.  A comparison of signalling alphabets , 1952 .

[7]  Zoltán Füredi.  On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.

[8]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[9]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[10]  D. Du,et al.  Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing , 2006 .

[11]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[12]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[13]  Sidharth Jaggi,et al.  Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms , 2014, IEEE Trans. Inf. Theory.

[14]  A.C. Gilbert,et al.  Group testing and sparse signal recovery , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[15]  Enrique Mallada,et al.  Compressive sensing over graphs , 2010, 2011 Proceedings IEEE INFOCOM.

[16]  Dmitry M. Malioutov,et al.  Boolean compressed sensing: LP relaxation for group testing , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[17]  Milton Sobel,et al.  Group testing with a new goal, estimation , 1975 .

[18]  Arkadii G. D'yachkov,et al.  Lectures on Designing Screening Experiments , 2014, ArXiv.

[19]  M. Malyutov,et al.  Maximization of ESI. Jaynes principle in testing significant inputs of linear model , 1998 .

[20]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[21]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[22]  M. Malyutov.  The separating property of random matrices , 1978 .

[23]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[24]  Zoltán Füredi,et al.  Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.

[25]  Mikhail Malyutov.  Recovery of sparse active inputs in general systems: A review , 2010, 2010 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering (SIBIRCON).

[26]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[27]  A. Macula.  Probabilistic nonadaptive group testing in the presence of errors and DNA library screening , 1999 .

[28]  J. Rice.  Mathematical Statistics and Data Analysis , 1988 .

[29]  Venkatesh Saligrama,et al.  Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[30]  Arkadii G. D'yachkov,et al.  Universal decoding for random design of screening experiments , 1989 .

[31]  V. V. Rykov,et al.  Superimposed distance codes , 1989 .

[32]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[33]  Anthony J. Macula,et al.  Error-correcting Nonadaptive Group Testing with de-disjunct Matrices , 1997, Discret. Appl. Math..

[34]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[35]  Dino Sejdinovic,et al.  Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[36]  Jean-Luc Starck,et al.  Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[37]  Graham Cormode,et al.  Combinatorial Algorithms for Compressed Sensing , 2006 .