English
Related papers

Related papers: Adaptive group testing as channel coding with feed…

200 papers

Recent research revealed a considerable lack of reliability for user feedback when interacting with adaptive systems, often denoted as user noise or human uncertainty. Moreover, this lack of reliability holds striking impacts for the…

Human-Computer Interaction · Computer Science 2018-05-01 Kevin Jasberg , Sergej Sizov

Group testing has recently attracted significant attention from the research community due to its applications in diagnostic virology. An instance of the group testing problem includes a ground set of individuals which includes a small…

Information Theory · Computer Science 2022-02-25 Esmaeil Karimi , Anoosheh Heidarzadeh , Krishna R. Narayanan , Alex Sprintson

This paper considers the problem of Quantitative Group Testing (QGT) where there are some defective items among a large population of $N$ items. We consider the scenario in which each item is defective with probability $K/N$, independently…

Information Theory · Computer Science 2019-10-16 Esmaeil Karimi , Fatemeh Kazemi , Anoosheh Heidarzadeh , Krishna R. Narayanan , Alex Sprintson

From scientific experiments to online A/B testing, the previously observed data often affects how future experiments are performed, which in turn affects which data will be collected. Such adaptivity introduces complex correlations between…

Machine Learning · Statistics 2018-01-03 Xinkun Nie , Xiaoying Tian , Jonathan Taylor , James Zou

We study Probabilistic Group Testing of a set of N items each of which is defective with probability p. We focus on the double limit of small defect probability, p<<1, and large number of variables, N>>1, taking either p->0 after…

Data Structures and Algorithms · Computer Science 2007-11-14 Marc Mezard , Cristina Toninelli

Negative sampling is essential for implicit-feedback-based collaborative filtering, which is used to constitute negative signals from massive unlabeled data to guide supervised learning. The state-of-the-art idea is to utilize hard negative…

Information Retrieval · Computer Science 2023-08-14 Yuhan Zhao , Rui Chen , Riwei Lai , Qilong Han , Hongtao Song , Li Chen

We have a large number of samples and we want to find the infected ones using as few number of tests as possible. We can use group testing which tells about a small group of people whether at least one of them is infected. Group testing is…

Quantitative Methods · Quantitative Biology 2020-05-07 Endre Csóka

This paper considers the problem of acquiring an unknown target location (among a finite number of locations) via a sequence of measurements, where each measurement consists of simultaneously probing a group of locations. The resulting…

Information Theory · Computer Science 2019-01-30 Anusha Lalitha , Nancy Ronquillo , Tara Javidi

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

The goal of combinatorial group testing is to efficiently identify up to $d$ defective items in a large population of $n$ items, where $d \ll n$. Defective items satisfy certain properties while the remaining items in the population do not.…

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

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

Genome-wide association analysis has generated much discussion about how to preserve power to detect signals despite the detrimental effect of multiple testing on power. We develop a weighted multiple testing procedure that facilitates the…

Statistics Theory · Mathematics 2007-06-13 Kathryn Roeder , Bernie Devlin , Larry Wasserman

In the long-studied problem of combinatorial group testing, one is asked to detect a set of $k$ defective items out of a population of size $n$, using $m \ll n$ disjunctive measurements. In the non-adaptive setting, the most widely used…

Information Theory · Computer Science 2020-09-28 Mahdi Cheraghchi , Vasileios Nakos

In multi-terminal networks, feedback increases the capacity region and helps communication devices to coordinate. In this article, we deepen the relationship between coordination and feedback by considering a point-to-point scenario with an…

Information Theory · Computer Science 2016-11-15 Maël Le Treust

Group testing is a well-known search problem that consists in detecting of $s$ defective members of a set of $t$ samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all…

Information Theory · Computer Science 2019-05-01 Ilya Vorobyev

The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as compressive sensing, and subset selection in…

Information Theory · Computer Science 2016-08-31 Jonathan Scarlett , Volkan Cevher

We study a correlated group testing model where items are infected according to a Markov chain, which creates bursty binfection patterns. Focusing on a very sparse infections regime, we propose a non adaptive testing strategy with an…

Information Theory · Computer Science 2025-01-27 Aditya Narayan Ravi , Ilan Shomorony

In this work we consider the large-coalition asymptotics of various fingerprinting and group testing games, and derive explicit expressions for the capacities for each of these models. We do this both for simple decoders (fast but…

Information Theory · Computer Science 2015-10-01 Thijs Laarhoven

We consider the nonadaptive group testing with N items, of which $K = \Theta(N^\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests…

Information Theory · Computer Science 2018-09-26 Oliver Johnson , Matthew Aldridge , Jonathan Scarlett

Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following…

Other Statistics · Statistics 2018-04-17 Yaakov Malinovsky