中文
相关论文

相关论文: The Capacity of Adaptive Group Testing

200 篇论文

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 is relevant in applications such as medical testing, communication protocols, pattern…

信息论 · 计算机科学 2018-10-05 Jonathan Scarlett

We consider the group testing problem, in the case where the items are defective independently but with non-constant probability. We introduce and analyse an algorithm to solve this problem by grouping items together appropriately. We give…

信息论 · 计算机科学 2015-02-04 Tom Kealy , Oliver Johnson , Robert Piechocki

In this paper, we consider the group testing problem with adaptive test designs and noisy outcomes. We propose a computationally efficient four-stage procedure with components including random binning, identification of bins containing…

统计计算 · 统计学 2019-11-11 Jonathan Scarlett

We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noiseless, and the case when the measurements are…

信息论 · 计算机科学 2011-07-25 Chun Lam Chan , Pak Hou Che , Sidharth Jaggi , Venkatesh Saligrama

Group testing is the combinatorial problem of identifying the defective items in a population by grouping items into test pools. Recently, nonadaptive group testing - where all the test pools must be decided on at the start - has been…

信息论 · 计算机科学 2013-01-31 Matthew Aldridge

We consider some computationally efficient and provably correct algorithms with near-optimal sample-complexity for the problem of noisy non-adaptive group testing. Group testing involves grouping arbitrary subsets of items into pools. Each…

信息论 · 计算机科学 2016-11-18 Chun Lam Chan , Sidharth Jaggi , Venkatesh Saligrama , Samar Agnihotri

The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test several individuals together. In an idealized setting, a test…

信息论 · 计算机科学 2023-09-19 Oliver Gebhard , Oliver Johnson , Philipp Loick , Maurice Rolvien

Non-adaptive group testing refers to the problem of inferring a sparse set of defectives from a larger population using the minimum number of simultaneous pooled tests. Recent positive results for noiseless group testing have motivated the…

信息论 · 计算机科学 2021-07-16 Gabriel Arpino , Nicolò Grometto , Afonso S. Bandeira

In this paper, we study the problem of quantitative group testing (QGT) and analyze the performance of three models: the noiseless model, the additive Gaussian noise model, and the noisy Z-channel model. For each model, we analyze two…

信息论 · 计算机科学 2026-04-21 Tenghao Li , Neha Sangwan , Xiaxin Li , Arya Mazumdar

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…

信息论 · 计算机科学 2021-11-12 Bernard Teo , Jonathan Scarlett

Accurate detection of infected individuals is one of the critical steps in stopping any pandemic. When the underlying infection rate of the disease is low, testing people in groups, instead of testing each individual in the population, can…

统计方法学 · 统计学 2021-10-07 Mingzhou Fan , Byung-Jun Yoon , Francis J. Alexander , Edward R. Dougherty , Xiaoning Qian

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

离散数学 · 计算机科学 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

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 is relevant in applications such as medical testing, communication protocols, pattern…

信息论 · 计算机科学 2023-09-19 Jonathan Scarlett , Oliver Johnson

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number…

数据结构与算法 · 计算机科学 2023-12-22 Nader H. Bshouty , Vivian E. Bshouty-Hurani , George Haddad , Thomas Hashem , Fadi Khoury , Omar Sharafy

We derive an information-theoretic lower bound for sample complexity in sparse recovery problems where inputs can be chosen sequentially and adaptively. This lower bound is in terms of a simple mutual information expression and unifies many…

信息论 · 计算机科学 2014-04-30 Cem Aksoylar , Venkatesh Saligrama

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…

信息论 · 计算机科学 2016-04-05 Jonathan Scarlett , Volkan Cevher

The fundamental task of group testing is to recover a small distinguished subset of items from a large population while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new…

信息论 · 计算机科学 2015-03-13 George Kamal Atia , Venkatesh Saligrama

An information theoretic perspective on group testing problems has recently been proposed by Atia and Saligrama, in order to characterise the optimal number of tests. Their results hold in the noiseless case, where only false positives…

信息论 · 计算机科学 2013-03-20 Dino Sejdinovic , Oliver Johnson

The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no…

信息论 · 计算机科学 2026-05-15 Matthew Aldridge , Oliver Johnson , Jonathan Scarlett

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…

信息论 · 计算机科学 2017-11-16 Matthew Aldridge
‹ 上一页 1 2 3 10 下一页 ›