English
Related papers

Related papers: Improved encoding and decoding for non-adaptive th…

200 papers

Given $p$ samples, each of which may or may not be defective, group testing (GT) aims to determine their defect status by performing tests on $n < p$ `groups', where a group is formed by mixing a subset of the $p$ samples. Assuming that the…

Machine Learning · Statistics 2025-07-25 Shuvayan Banerjee , Radhendushka Srivastava , James Saunderson , Ajit Rajwade

We consider the probabilistic group testing problem where $d$ random defective items in a large population of $N$ items are identified with high probability by applying binary tests. It is known that $\Theta(d \log N)$ tests are necessary…

Information Theory · Computer Science 2019-02-27 Huseyin A. Inan , Peter Kairouz , Mary Wootters , Ayfer Ozgur

Group testing enables to identify infected individuals in a population using a smaller number of tests than individual testing. To achieve this, group testing algorithms commonly assume knowledge of the number of infected individuals;…

Information Theory · Computer Science 2023-05-16 Chaorui Yao , Pavlos Nikolopoulos , Christina Fragouli

In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multiple individuals, with the test result coming out positive iff…

Discrete Mathematics · Computer Science 2021-05-14 Amin Coja-Oghlan , Oliver Gebhard , Max Hahn-Klimroth , Philipp Loick

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 $\{0,1\}$ with a fixed probability $p$. The…

Machine Learning · Computer Science 2017-08-10 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla

In this note, we present a new adaptive algorithm for generalized group testing, which is asymptotically optimal if $d=o(\log_2|E|)$, $E$ is a set of potentially contaminated sets, $d$ is a maximal size of elements of $E$. Also, we design a…

Information Theory · Computer Science 2022-11-09 Ilya Vorobyev

We consider adaptive group testing in the linear regime, where the number of defective items scales linearly with the number of items. We analyse an algorithm based on generalized binary splitting. Provided fewer than half the items are…

Information Theory · Computer Science 2020-04-07 Matthew Aldridge

We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease within a population of size n, based on the outcomes of pooled tests which return positive whenever there is at least…

Machine Learning · Statistics 2022-06-16 Amin Coja-Oghlan , Oliver Gebhard , Max Hahn-Klimroth , Alexander S. Wein , Ilias Zadik

We study combinatorial group testing schemes for learning $d$-sparse Boolean vectors using highly unreliable disjunctive measurements. We consider an adversarial noise model that only limits the number of false observations, and show that…

Discrete Mathematics · Computer Science 2015-05-13 Mahdi Cheraghchi

We consider nonadaptive group testing with Bernoulli tests, where each item is placed in each test independently with some fixed probability. We give a tight threshold on the maximum number of tests required to find the defective set under…

Information Theory · Computer Science 2017-11-16 Matthew Aldridge

The goal of group testing is to identify a small number of defective items within a large population. In the non-adaptive setting, tests are designed in advance and represented by a measurement matrix $\mM$, where rows correspond to tests…

Information Theory · Computer Science 2025-09-10 Trung-Khang Tran , Thach V. Bui

The main goal of group testing with inhibitors (GTI) is to efficiently identify a small number of defective items and inhibitor items in a large set of items. A test on a subset of items is positive if the subset satisfies some specific…

Information Theory · Computer Science 2019-02-12 Thach V. Bui , Minoru Kuribayashi , Mahdi Cheraghchi , Isao Echizen

We explore the problem of deriving a posteriori probabilities of being defective for the members of a population in the non-adaptive group testing framework. Both noiseless and noisy testing models are addressed. The technique, which relies…

Information Theory · Computer Science 2021-02-11 Gianluigi Liva , Enrico Paolini , Marco Chiani

Consider $n$ items, each of which is characterised by one of $d+1$ possible features in $\{0, \ldots, d\}$. We study the inference task of learning these types by queries on subsets, or pools, of the items that only reveal a form of…

Information Theory · Computer Science 2022-02-10 Max Hahn-Klimroth , Noela Müller

Group testing (GT) is the Boolean version of spare signal recovery and, due to its simplicity, a marketplace for ideas that can be brought to bear upon related problems, such as heavy hitters, compressed sensing, and multiple access…

Information Theory · Computer Science 2024-04-08 Venkatesan Guruswami , Hsin-Po Wang

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 has numerous practical applications. One of the defining features of group testing is…

Information Theory · Computer Science 2021-11-12 Bernard Teo , Jonathan Scarlett

In industrial engineering and manufacturing, quality control is an essential part of the production process of a product. To ensure proper functionality of a manufactured good, rigorous testing has to be performed to identify defective…

Methodology · Statistics 2025-04-02 Michael Balzer

We consider the quantitative group testing problem where the objective is to identify defective items in a given population based on results of tests performed on subsets of the population. Under the quantitative group testing model, the…

Information Theory · Computer Science 2017-10-24 Chao Wang , Qing Zhao , Chen-Nee Chuah

We consider nonadaptive probabilistic group testing in the linear regime, where each of n items is defective independently with probability p in (0,1), and p is a constant independent of n. We show that testing each item individually is…

Information Theory · Computer Science 2025-09-26 Matthew Aldridge

In this work we prove non-trivial impossibility results for perhaps the simplest non-linear estimation problem, that of {\it Group Testing} (GT), via the recently developed Madiman-Tetali inequalities. Group Testing concerns itself with…

Information Theory · Computer Science 2018-04-11 Abhishek Agarwal , Sidharth Jaggi , Arya Mazumdar
‹ Prev 1 4 5 6 7 8 10 Next ›