Non-Adaptive Randomized Algorithm for Group Testing

Total Page:16

File Type:pdf, Size:1020Kb

Non-Adaptive Randomized Algorithm for Group Testing Proceedings of Machine Learning Research 76:1{20, 2017 Algorithmic Learning Theory 2017 Non-Adaptive Randomized Algorithm for Group Testing Nader H. Bshouty [email protected] Dept. of Computer Science Technion, Haifa, 32000 Nuha Diab [email protected] Sisters of Nazareth High School 12th Grade P.O.B. 9422, Haifa, 35661 Shada R. Kawar [email protected] Nazareth Baptist High School 11th Grade P.O.B. 20, Nazareth, 16000 Robert J. Shahla [email protected] Sisters of Nazareth High School 11th Grade P.O.B. 9422, Haifa, 35661 Editors: Steve Hanneke and Lev Reyzin Abstract We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from f0; 1g with a fixed probability p. The property that is sufficient and necessary for a unique decoding is the separability of the tests, but unfortunately no linear time algorithm is known for such tests. In order to achieve linear-time decodable tests, the algorithms in the literature use the disjunction property that gives almost optimal number of tests. We define a new property for the tests which we call semi-disjunction property. We show that there is a linear time decoding for such test and for d ! 1 the number of tests converges to the number of tests with the separability property. Our analysis shows that, in the RID model, the number of tests in our algorithm is better than the one with the disjunction property even for small d. Keywords: Group Testing, Non-adaptive Algorithm, Randomized Algorithm, RID Algo- rithm. 1. Introduction As quoted in Wikipedia., \Robert Dorfman's paper in 1943, Dorfman(1943), introduced the field of Group Testing. The motivation arose during the Second World War when the United States Public Health Service and the Selective service embarked upon a large scale c 2017 N.H. Bshouty, N. Diab, S.R. Kawar & R.J. Shahla. Non-Adaptive Randomized Algorithm for Group Testing project. The objective was to weed out all syphilitic men called up for induction. However, syphilis testing back then was expensive and testing every soldier individually would have been very cost heavy and inefficient. A basic breakdown of a test is: Draw sample from a given individual, perform required tests and determine the presence or absence of syphilis. Suppose we have n soldiers. Then this method of testing leads to n tests. Our goal is to achieve effective testing in a scenario where it does not make sense to test 100; 000 people to get (say) 10 positives. The feasibility of a more effective testing scheme hinges on the following property. We can combine blood samples and test a combined sample together to check if at least one soldier has syphilis". Group testing was originally introduced as a potential approach to the above econom- ical mass blood testing, Dorfman(1943). However it has been proven to be applicable in a variety of problems, including quality control in product testing, Sobel and Groll(1959), searching files in storage systems, Kautz and Singleton(1964), sequential screening of exper- imental variables, Li(1962), efficient contention resolution algorithms for multiple-access communication, Kautz and Singleton(1964); Wolf(1985), data compression, Hong and Ladner(2002), and computation in the data stream model, Cormode and Muthukrish- nan(2005). See a brief history and other applications in Cicalese(2013); Du and Hwang (2000, 2006); Hwang(1972); Macula and Popyack(2004); Ngo and Du(1999) and references therein. We now formalize the problem. Let S be the set of the n items (soldiers, clones) and let I ⊆ S be the set of defective items (the sick soldiers, positive clone). Suppose we know that the number of defective items, jIj, is bounded by some integer d.A test or a query (pool or probing) is a set J ⊂ S. The answer to the test is T (I;J) = 1 if I \ J 6= Ø and 0 otherwise. Here J is the set of soldiers for which their blood samples is combined. The problem is to find the defective items (sick soldiers) with a minimum number of tests. We will assume that S = [n] := f1; 2; : : : ; ng and will identify the test J ⊆ S with an assignment J n J J a 2 f0; 1g where ai = 1 if and only if i 2 J, i.e., ai = 1 signifies that item i is in test J. J J J Then the answer to the test a is T (I; a ) = 1 (positive) if there is i 2 I such that ai = 1 and 0 (negative) otherwise. In the adaptive algorithm, the tests can depend on the answers to the previous ones. In the non-adaptive algorithm they are independent of the previous one and; therefore, one can do all the tests in one parallel step. In all the above applications, non-adaptive algorithms are most desirable since minimizing time is of utmost importance. The set of tests in any non-adaptive deterministic algorithm (resp. randomized) can be identified with a (resp. random) m × n test matrix M (pool design) such that its rows are all the assignments aJ of all the tests J in the algorithm. The above problem is also equivalent to the problem of non-adaptive deterministic (resp. randomized) learning the class of boolean disjunction of up to d variables from membership queries Bshouty(2013, 2017). It is known that any non-adaptive deterministic algorithm must do at least Ω(d2 log n= log d) tests D'yachkov and Rykov(1982); F¨uredi(1996); Porat and Rothschild(2011); Ruszink´o(1994). This is O(d= log d) times more than the number of tests of the known non-adaptive randomized algorithms that do only O(d log n) tests. In this paper we study the case where the number of items n is very large and the cost of the test is \very expen- sive" and in that case, deterministic algorithms are impractical. Also, algorithms that run in super-linear time are not practical for group testing. So we need our algorithms to do a 2 Non-Adaptive Randomized Algorithm for Group Testing minimum number of tests and run in quasi-linear time, preferably, linear time in the size of all the tests, that is, O(dn log n). Non-adaptive randomized algorithms have been proposed in Balding et al.(1995); Bruno et al.(1995); Du and Hwang(2006); Erd¨osand R´enyi(1963); Hwang(2000); Hwang and Liu(2001). The first folklore non-adaptive randomized algorithm known from the literature simply chooses a random m × n test matrix M, for sufficiently large m, where each entry of M is chosen randomly independently to be 0 with probability p and 1 with probability 1 − p. This type of algorithm is called a random incidence design (RID) and is the simplest type of randomized algorithm. In this paper we will study this type of algorithms. If I ⊆ S = [n] is the set of defective items then the vector of answers to the tests (rows (i) (i) of M) is T (I;M) := _i2I M where _ is bitwise \or" and M is the ith column of M. The above parameters, m and p, are chosen so that the probability of success of recovering the defective items (decoding) is maximal. If the number of defective items is bounded by jIj ≤ d then in order to find the defective items with probability at least 1 − δ, we need that with probability at least 1 − δ, M satisfies the following property: For every J ⊆ [n], jJj ≤ d and J 6= I we have T (J; M) 6= T (I;M). This basically says that the only set J (i) of up to d items that is consistent with the answers of the tests ^i2I M is I. We call such a property (I; d)-separable property and M is called an (I; d)-separable test matrix. Unfortunately, although this property is what we need to solve the problem, there is no known linear time (or even polynomial time) algorithm that finds the defective items from the answers of an (I; d)-separable test matrix. The only known algorithm is the trivial one that exhaustively goes over all possible up to d sets J and verifies whether T (J; M) is equal to the answers of the tests. This is one of the reasons why the separability property has not been much studied in the literature. Seb¨o, Seb¨o(1985), studies the easy case when the number of defective items is exactly d. He shows that the best probability for the random test matrix (i.e., that gives a minimum number of tests) is p = 1−1=21=d. In this paper, we study the general case when the number of defective items is at most d. We give a new analysis for the general case and show that the probability that gives minimum number of tests is p = 1 − 1=d. In particular, we show that mRID 1 e + 1 1 lim ≤ γd−1 + O := ed − + O (1) n!1 ln n d 2 d where mRID is the minimum number of tests in the RID algorithms, e = 2:71828 ··· is the Euler's number and γd is defined in (2). But again, no polynomial time algorithm is known for such matrix even for the special case when the number of the defective items is exactly d. To be able to find the defective items in linear time in the size of all the tests, that is, O(dn log n), and asymptotically optimal O(d log n) tests, algorithms in the literature use a relaxed property for M.
Recommended publications
  • Nber Working Paper Series Group Testing in a Pandemic
    NBER WORKING PAPER SERIES GROUP TESTING IN A PANDEMIC: THE ROLE OF FREQUENT TESTING, CORRELATED RISK, AND MACHINE LEARNING Ned Augenblick Jonathan T. Kolstad Ziad Obermeyer Ao Wang Working Paper 27457 http://www.nber.org/papers/w27457 NATIONAL BUREAU OF ECONOMIC RESEARCH 1050 Massachusetts Avenue Cambridge, MA 02138 July 2020 Authors in alphabetical order. We are grateful to Katrina Abuabara, Sylvia Barmack, Kate Kolstad, Maya Petersen, Annika Todd, Johannes Spinnewijn, and Nicholas Swanson for helpful comments. All opinions and errors are our own. The views expressed herein are those of the authors and do not necessarily reflect the views of the National Bureau of Economic Research. At least one co-author has disclosed a financial relationship of potential relevance for this research. Further information is available online at http://www.nber.org/papers/w27457.ack NBER working papers are circulated for discussion and comment purposes. They have not been peer-reviewed or been subject to the review by the NBER Board of Directors that accompanies official NBER publications. © 2020 by Ned Augenblick, Jonathan T. Kolstad, Ziad Obermeyer, and Ao Wang. All rights reserved. Short sections of text, not to exceed two paragraphs, may be quoted without explicit permission provided that full credit, including © notice, is given to the source. Group Testing in a Pandemic: The Role of Frequent Testing, Correlated Risk, and Machine Learning Ned Augenblick, Jonathan T. Kolstad, Ziad Obermeyer, and Ao Wang NBER Working Paper No. 27457 July 2020 JEL No. I1,I18 ABSTRACT Group testing increases efficiency by pooling patient specimens and clearing the entire group with one negative test.
    [Show full text]
  • Group Testing
    Group Testing Amit Kumar Sinhababu∗ and Vikraman Choudhuryy Department of Computer Science and Engineering, Indian Institute of Technology Kanpur April 21, 2013 1 Motivation Out original motivation in this project was to study \coding theory in data streaming", which has two aspects. • Applications of theory correcting codes to efficiently solve problems in the model of data streaming. • Solving coding theory problems in the model of data streaming. For ex- ample, \Can one recognize a Reed-Solomon codeword in one-pass using only poly-log space?" [1] As we started, we were directed to a related combinatorial problem, \Group testing", which is important on its own, having connections with \Compressed Sensing", \Data Streaming", \Coding Theory", \Expanders", \Derandomiza- tion". This project report surveys some of these interesting connections. 2 Group Testing The group testing problem is to identify the set of \positives" (\defectives", or \infected", or 1) from a large set of population/items, using as few tests as possible. ∗[email protected] [email protected] 1 2.1 Definition There is an unknown stream x 2 f0; 1gn with at most d ones in it. We are allowed to test any subset S of the indices. The answer to the test tells whether xi = 0 for all i 2 S, or not (at least one xi = 1). The objective is to design as few tests as possible (t tests) such that x can be identified as fast as possible. Group testing strategies can be either adaptive or non-adaptive. A group testing algorithm is non-adaptive if all tests must be specified without knowing the outcome of other tests.
    [Show full text]
  • The Illusion of Group Testing Teddy Furon
    The illusion of group testing Teddy Furon To cite this version: Teddy Furon. The illusion of group testing. [Research Report] RR-9164, Inria Rennes Bretagne Atlantique. 2018, pp.1-19. hal-01744252 HAL Id: hal-01744252 https://hal.inria.fr/hal-01744252 Submitted on 27 Mar 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The illusion of group testing Teddy Furon RESEARCH REPORT N° 9164 March 2018 Project-Team Linkmedia ISSN 0249-6399 ISRN INRIA/RR--9164--FR+ENG The illusion of group testing Teddy Furon Project-Team Linkmedia Research Report n° 9164 — March 2018 — 19 pages Abstract: This report challenges the assumptions usually made in non-adaptive group testing. The test is usually modelled as a probabilistic mechanism prone to false positive and / or false negative errors. However, the models are still too optimistic because the performances of these non ideal tests are assumed to be independent of the size of the groups. Without this condition, the report shows that the promises of group test (a number of tests and a decoding complexity scaling as c log N) do not hold. Key-words: Group testing, hypothesis testing, identification, information theory This work has been done for the CHIST-ERA project IDentification for the Internet Of Things - ID_IOT RESEARCH CENTRE RENNES – BRETAGNE ATLANTIQUE Campus universitaire de Beaulieu 35042 Rennes Cedex L’illusion des tests par groupe Résumé : Ce rapport de recherche présente une investigation sur les hypothèses parfois cachées en test par groupe.
    [Show full text]
  • Group Testing-Based Robust Algorithm for Diagnosis of COVID-19
    diagnostics Article Group Testing-Based Robust Algorithm for Diagnosis of COVID-19 Jin-Taek Seong Department of Convergence Software, Mokpo National University, Muan 58554, Korea; [email protected] Received: 28 April 2020; Accepted: 8 June 2020; Published: 11 June 2020 Abstract: At the time of writing, the COVID-19 infection is spreading rapidly. Currently, there is no vaccine or treatment, and researchers around the world are attempting to fight the infection. In this paper, we consider a diagnosis method for COVID-19, which is characterized by a very rapid rate of infection and is widespread. A possible method for avoiding severe infections is to stop the spread of the infection in advance by the prompt and accurate diagnosis of COVID-19. To this end, we exploit a group testing (GT) scheme, which is used to find a small set of confirmed cases out of a large population. For the accurate detection of false positives and negatives, we propose a robust algorithm (RA) based on the maximum a posteriori probability (MAP). The key idea of the proposed RA is to exploit iterative detection to propagate beliefs to neighbor nodes by exchanging marginal probabilities between input and output nodes. As a result, we show that our proposed RA provides the benefit of being robust against noise in the GT schemes. In addition, we demonstrate the performance of our proposal with a number of tests and successfully find a set of infected samples in both noiseless and noisy GT schemes with different COVID-19 incidence rates. Keywords: COVID-19; diagnosis; group testing; posterior probability; robust algorithm 1.
    [Show full text]
  • On the Cut-Off Point for Combinatorial Group Testing
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector DISCRETE APPLIED MATHEMATICS ELSWIER Discrete Applied Mathematics 91 (I 999) X3-92 On the cut-off point for combinatorial group testing Paul Fischer a, Norbert Klasner b, Ingo Wegener ‘,*.I Received 3 July 1997; received in revised form 6 July 1998: accepted IO August 199X Abstract The following problem is known as group testing problem for n objects. Each object can be essential (defective) or non-essential (intact). The problem is to determine the set of essential objects by asking queries adaptively. A query can be identified with a set e of objects and the query e is answered by I if p contains at least one essential object and by 0 otherwise. In the statistical setting the objects are essential, independently of each other, with a given probability p< 1 while in the combinatorial setting the number k < n of essential objects is known. The cut-off point of statistical group testing is equal to p* = i(3 - &), i.e., the strategy of testing each object individually minimizes the average number of queries iff p > p* or n = I. In the combinatorial setting the worst case number of queries is of interest. It has been conjectured that the cut-off point of combinatorial group testing is equal to r* = f. i.e., the strategy of testing II - I objects individually minimizes the worst case number of queries iff k/n b T* and k < II. Some results in favor of this conjecture are proved.
    [Show full text]
  • Group Testing Schemes from Codes and Designs
    1 Group testing schemes from codes and designs Alexander Barg and Arya Mazumdar Abstract In group testing, simple binary-output tests are designed to identify a small number t of defective items that are present in a large population of N items. Each test takes as input a group of items and produces a binary output indicating whether the group is free of the defective items or contains one or more of them. In this paper we study a relaxation of the combinatorial group testing problem. A matrix is called (t,ǫ)-disjunct if it gives rise to a nonadaptive group testing scheme with the property of identifying a uniformly random t-set of defective subjects out of a population of size N with false positive probability of an item at most ǫ. We establish a new connection between (t,ǫ)-disjunct matrices and error correcting codes based on the dual distance of the codes and derive estimates of the parameters of codes that give rise to such schemes. Our methods rely on the moments of the distance distribution of codes and inequalities for moments of sums of independent random variables. We also provide a new connection between group testing schemes and combinatorial designs. Keywords: Group testing, disjunct matrices, error-correcting codes, constant weight codes, dual distance, combinatorial designs. I. INTRODUCTION Suppose that the elements of a finite population of size N contain a small number of defective elements. The elements are tested in groups, and the collection of tests is said to form a group testing scheme if the outcomes of the tests enable one to identify any defective configuration size at most t.
    [Show full text]
  • A Maxsat-Based Framework for Group Testing
    The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20) A MaxSAT-Based Framework for Group Testing Lorenzo Ciampiconi,1 Bishwamittra Ghosh,2 Jonathan Scarlett,2 Kuldeep S Meel2 1Politecnico di Milano, 2National University of Singapore Abstract be formulated as a combinatorial optimization problem (Du, Hwang, and Hwang 2000; Malioutov and Malyutov 2012; The success of MaxSAT (maximum satisfiability) solving Aldridge, Baldassini, and Johnson 2014). The design phase in recent years has motivated researchers to apply MaxSAT can be modeled in two ways: adaptive and non-adaptive test- solvers in diverse discrete combinatorial optimization prob- lems. Group testing has been studied as a combinatorial op- ing (Aldridge, Johnson, and Scarlett 2019). In adaptive test- timization problem, where the goal is to find defective items ing, the test pools are designed sequentially, wherein each among a set of items by performing sets of tests on items. test depends on the outcome of the previous ones. In the In this paper, we propose a MaxSAT-based framework, called case of non-adaptive testing, all test pools are designed in MGT, that solves group testing, in particular, the decoding advance, which allows parallel implementation. In a more phase of non-adaptive group testing. We extend this approach practical setting, a noisy variant to group testing is consid- to the noisy variant of group testing, and propose a compact ered where tests are inverted/flipped according to some spe- MaxSAT-based encoding that guarantees an optimal solution. cific random model or in an adversarial manner (Aldridge, Our extensive experimental results show that MGT can solve 10000 3% Johnson, and Scarlett 2019).
    [Show full text]
  • Neural Group Testing to Accelerate Deep Learning
    Neural Group Testing to Accelerate Deep Learning Weixin Liang and James Zou Stanford University, Stanford, CA 94305 Email: {wxliang, jamesz}@stanford.edu Abstract—Recent advances in deep learning have made the use GROUP TESTING of large, deep neural networks with tens of millions of param- A mathematical strategy for discovering positive items in a large population. The core idea is to test multiple samples at once to save time and money. eters. The sheer size of these networks imposes a challenging computational burden during inference. Existing work focuses Algorithm 1: Two-Round Testing Algorithm 2: Multi-Round Testing Samples are mixed together in equal-sized This algorithm adds extra rounds of primarily on accelerating each forward pass of a neural network. groups and tested. If a group tests positive, group testing to algorithm 1, reducing Inspired by the group testing strategy for efficient disease testing, every sample is retested individually. the total number of tests needed. we propose neural group testing, which accelerates by testing a Round 1: 3 tests Round 1: 3 tests group of samples in one forward pass. Groups of samples that test negative are ruled out. If a group tests positive, samples in that group are then retested adaptively. A key challenge of neural group testing is to modify a deep neural network so that it could Negative Positive Negative Positive test multiple samples in one forward pass. We propose three de- Round 2: 9 tests Round 2: 3 tests signs to achieve this without introducing any new parameters and evaluate their performances. We applied neural group testing in Positive an image moderation task to detect rare but inappropriate images.
    [Show full text]
  • A Survey on Combinatorial Group Testing Algorithms with Applications to DNA Library Screening
    DIMACS Series in Discrete Mathematics and Theoretical Computer Science A Survey on Combinatorial Group Testing Algorithms with Applications to DNA Library Screening Hung Q. Ngo and Ding-Zhu Du ABSTRACT. In this paper, we give an overview of Combinatorial Group Testing algo- rithms which are applicable to DNA Library Screening. Our survey focuses on several classes of constructions not discussed in previous surveys, provides a general view on pooling design constructions and poses several open questions arising from this view. 1. Introduction The basic problem of DNA library screening is to determine which clone (a DNA segment) from the library contains which probe from a given collection of probes in an efficient fashion. A clone is said to be positive for a probe if it contains the probe, and negative otherwise. In practice clones are pooled together in some manner to be tested against each probe, since checking each clone-probe pair is expensive and usually only a few clones contain any given probe. An example is when Sequenced-Tagged Site markers (also called STS probes) are used [OHCB89]. If the test result for a pool (of clones) is negative, indicating that no clone in the pool contains the probe, then no further tests are needed for the clones in the pool. This problem is just an instance of the general group testing problem, in which a large population of items containing a small set of defectives are to be tested to identify the defectives efficiently. We assume some testing mechanism exists which if applied to an arbitrary subset of the population gives a negative outcome if the subset contains no defec- tive and positive outcome otherwise.
    [Show full text]
  • Group Testing: an Information Theory Perspective
    Group Testing: An Information Theory Perspective Matthew Aldridge1, Oliver Johnson2, and Jonathan Scarlett3 1University of Leeds, [email protected] 2University of Bristol, [email protected] 3National University of Singapore, [email protected] December 2019 arXiv:1902.06002v3 [cs.IT] 17 Aug 2020 Contents Acknowledgments 2 Notation 3 1 Introduction to Group Testing 5 1.1 What is group testing? . .5 1.2 About this survey . .7 1.3 Basic definitions and notation . .9 1.4 Counting bound and rate . 13 1.5 A brief review of noiseless adaptive group testing . 16 1.6 A brief review of zero-error nonadaptive group testing . 19 1.7 Applications of group testing . 22 Appendix: Comparison of combinatorial and i.i.d. priors . 26 2 Algorithms for Noiseless Group Testing 30 2.1 Summary of algorithms . 30 2.2 SSS: Smallest satisfying set . 33 2.3 COMP: Combinatorial orthogonal matching pursuit . 37 2.4 DD: Definite defectives . 39 2.5 SCOMP: Sequential COMP . 43 2.6 Linear programming relaxations . 44 2.7 Improved rates with near-constant tests-per-item . 46 3 Algorithms for Noisy Group Testing 50 3.1 Noisy channel models . 50 3.2 Noisy linear programming relaxations . 55 3.3 Belief propagation . 56 3.4 Noisy COMP . 59 3.5 Separate decoding of items . 60 3.6 Noisy (near-)definite defectives . 62 3.7 Rate comparisons and numerical simulations . 63 4 Information-Theoretic Limits 67 4.1 Overview of the standard noiseless model . 67 4.2 Proof of achievable rate for Bernoulli testing . 70 4.3 Converse bound for Bernoulli testing .
    [Show full text]
  • Group Testing on a Network
    Group Testing on a Network Arlei Silva, Ambuj Singh University of California, Santa Barbara farlei,[email protected] Abstract mar 2020) but Dorfman’s design remains attractive due to its easy implementation. In particular, higher savings can be Group testing—where multiple samples are tested together using a single test kit and individual tests are performed only achieved with more rounds and stages of testing at the cost for samples in positive groups—is a popular strategy to opti- of more intricate procedures and/or longer wait times. mize the use of testing resources. We investigate how to ef- Dorfman assumed that groups were assembled at random. fectively group samples for testing based on a transmission Later studies have identified the importance of the grouping network. We formalize the group assembling problem as a step to minimize the use of testing resources. For instance, graph partitioning problem, where the goal is to minimize the when screening for a pathogen, a common guideline is to put expected number of tests needed to screen the entire network. together family members and other closely connected sub- The problem is shown to be computationally hard and thus we groups (Fang et al. 2020; Augenblick et al. 2020). However, focus on designing effective heuristics for it. Using realistic we know that people tend to maintain a complex network epidemic models on real contact networks, we show that our of contacts (Newman 2002; Salathe´ et al. 2010) and thus approaches save up to 33% of resources—compared to the best baseline—at 4% prevalence, are still effective at higher effectively assembling the groups becomes a challenge.
    [Show full text]
  • Group Testing Using Left-And-Right-Regular Sparse-Graph
    Group Testing using left-and-right-regular sparse-graph codes Avinash Vem, Nagaraj T. Janakiraman, Krishna R. Narayanan Department of Electrical and Computer Engineering Texas A&M University {vemavinash,tjnagaraj,krn}@tamu.edu Abstract—We consider the problem of non-adaptive group defective set should be equal to 1 whereas in the probabilistic testing of N items out of which K or less items are known to version one is interested in recovering all the defective items be defective. We propose a testing scheme based on left-and- with high probability (w.h.p) i.e., with probability approaching right-regular sparse-graph codes and a simple iterative decoder. We show that for any arbitrarily small ǫ > 0 our scheme 1 asymptotically in N and K. Another variant of the proba- c1N requires only m = cǫK log K tests to recover (1 − ǫ) fraction bilistic version is that the probability of recovery is required of the defective items with high probability (w.h.p) i.e., with to be greater than or equal to (1 − ε) for a given ε > 0. probability approaching 1 asymptotically in N and K, where the For the approximate recovery version one is interested in only value of constants cǫ and ℓ are a function of the desired error ℓ recovering a (1 − ǫ) fraction of the defective items (not the floor ǫ and constant c1 = (observed to be approximately cǫ equal to 1 for various values of ǫ). More importantly the whole set of defective items) w.h.p. iterative decoding algorithm has a sub-linear computational For the combinatorial GT the best known lower bound K N complexity of O( log K ) which is known to be optimal.
    [Show full text]