English
Related papers

Related papers: Improved algorithms for non-adaptive group testing…

200 papers

Inspired by applications in testing for Covid-19, we consider a variant of two-stage group testing called "conservative" (or "trivial") two-stage testing, where every item declared to be defective must be definitively confirmed by being…

Applications · Statistics 2022-03-10 Matthew Aldridge

We study the problem of identifying a small set $k\sim n^\theta$, $0<\theta<1$, of infected individuals within a large population of size $n$ by testing groups of individuals simultaneously. All tests are conducted concurrently. The goal is…

Discrete Mathematics · Computer Science 2025-03-05 Amin Coja-Oghlan , Max Hahn-Klimroth , Lukas Hintze , Dominik Kaaser , Lena Krieg , Maurice Rolvien , Olga Scheftelowitsch

We study the group testing problem with non-adaptive randomized algorithms. Several models have been discussed in the literature to determine how to randomly choose the tests. For a model ${\cal M}$, let $m_{\cal M}(n,d)$ be the minimum…

Machine Learning · Computer Science 2019-11-06 Nader H. Bshouty , George Haddad , Catherine A. Haddad-Zaknoon

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

In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are considered to be defective. We can test certain subsets of the…

Combinatorics · Mathematics 2012-04-09 Dániel Gerbner , Balázs Keszegh , Dömötör Pálvölgyi , Gábor Wiener

We consider the problem of group testing with sum observations and noiseless answers, in which we aim to locate multiple objects by querying the number of objects in each of a sequence of chosen sets. We study a probabilistic setting with…

Information Theory · Computer Science 2015-09-24 Weidong Han , Purnima Rajan , Peter I. Frazier , Bruno M. Jedynak

We describe group sequential tests which efficiently incorporate information from multiple endpoints allowing for early stopping at pre-planned interim analyses. We formulate a testing procedure where several outcomes are examined, and…

Methodology · Statistics 2024-05-09 Abigail J. Burdon , Thomas Jaki

We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the…

Information Theory · Computer Science 2015-06-26 Amin Emad , Olgica Milenkovic

The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive response if and only if the testing group contains at least…

Information Theory · Computer Science 2019-08-20 A. G. D'yachkov , N. A. Polyanskii , V. Yu. Shchukin , I. V. Vorobyev

We present a new optimization method for the group selection problem in linear regression. In this problem, predictors are assumed to have a natural group structure and the goal is to select a small set of groups that best fits the…

Methodology · Statistics 2024-04-23 Anant Mathur , Sarat Moka , Benoit Liquet , Zdravko Botev

In this paper, an information theoretic analysis on non-adaptive group testing schemes based on sparse pooling graphs is presented. The binary status of the objects to be tested are modeled by i.i.d. Bernoulli random variables with…

Information Theory · Computer Science 2013-04-29 Tadashi Wadayama

Combinatorial pooling schemes have enabled the measurement of thousands of experiments in a small number of reactions. This efficiency is achieved by distributing the items to be measured across multiple reaction units called pools.…

Information Theory · Computer Science 2025-02-13 Guanchen He , Vasilisa A. Kovaleva , Carl Barton , Paul G. Thomas , Mikhail V. Pogorelyy , Hannah V. Meyer , Qin Huang

Estimation using pooled sampling has long been an area of interest in the group testing literature. Such research has focused primarily on the assumed use of fixed sampling plans (i), although some recent papers have suggested alternative…

Statistics Theory · Mathematics 2017-03-27 Gregory Haber , Yaakov Malinovsky , Paul Albert

We modify Cheraghchi-Nakos [CN20] and Price-Scarlett's [PS20] fast binary splitting approach to nonadaptive group testing. We show that, to identify a uniformly random subset of $k$ infected persons among a population of $n$, it takes only…

Information Theory · Computer Science 2024-05-28 Hsin-Po Wang , Ryan Gabrys , Venkatesan Guruswami

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

In computerized adaptive testing (CAT), items (questions) are selected in real time based on the already observed responses, so that the ability of the examinee can be estimated as accurately as possible. This is typically formulated as a…

Statistics Theory · Mathematics 2015-01-08 Shiyu Wang , Georgios Fellouris , Hua-Hua Chang

We consider the problem of non-adaptive noiseless group testing of $N$ items of which $K$ are defective. We describe four detection algorithms: the COMP algorithm of Chan et al.; two new algorithms, DD and SCOMP, which require stronger…

Information Theory · Computer Science 2014-05-20 Matthew Aldridge , Leonardo Baldassini , Oliver Johnson

The use of group testing to locate all instances of disease in a large population of blood samples was first considered seventy years ago. Since then, several methods have been used to approximate the minimum expected number of tests. The…

Applications · Statistics 2015-03-24 Seth Zimmerman

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achievability and converse bounds are known in several cases of…

Information Theory · Computer Science 2016-04-05 Jonathan Scarlett , Volkan Cevher

Checklists are simple decision aids that are often used to promote safety and reliability in clinical applications. In this paper, we present a method to learn checklists for clinical decision support. We represent predictive checklists as…

Machine Learning · Computer Science 2022-01-19 Haoran Zhang , Quaid Morris , Berk Ustun , Marzyeh Ghassemi