Group testing: an information theory perspective
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 …
large population by performing tests on pools of items. A test is positive if the pool contains …
Active sequential hypothesis testing
M Naghshvar, T Javidi - 2013 - projecteuclid.org
Active sequential hypothesis testing Page 1 The Annals of Statistics 2013, Vol. 41, No. 6,
2703–2738 DOI: 10.1214/13-AOS1144 © Institute of Mathematical Statistics, 2013 ACTIVE …
2703–2738 DOI: 10.1214/13-AOS1144 © Institute of Mathematical Statistics, 2013 ACTIVE …
Group testing algorithms: Bounds and simulations
M Aldridge, L Baldassini… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
We consider the problem of nonadaptive noiseless group testing of N items of which K are
defective. We describe four detection algorithms, the COMP algorithm of Chan et al., two …
defective. We describe four detection algorithms, the COMP algorithm of Chan et al., two …
Non-adaptive group testing: Explicit bounds and novel algorithms
CL Chan, S Jaggi, V Saligrama… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
We consider some computationally efficient and provably correct algorithms with near-
optimal sample complexity for the problem of noisy nonadaptive group testing. Group testing …
optimal sample complexity for the problem of noisy nonadaptive group testing. Group testing …
[PDF][PDF] Search problems in cryptography: from fingerprinting to lattice sieving
T Laarhoven - 2016 - research.tue.nl
Search problems in cryptography Page 1 Search problems in cryptography: from fingerprinting
to lattice sieving Citation for published version (APA): Laarhoven, T. (2016). Search problems …
to lattice sieving Citation for published version (APA): Laarhoven, T. (2016). Search problems …
Optimal group testing
A Coja-Oghlan, O Gebhard… - … on Learning Theory, 2020 - proceedings.mlr.press
In the group testing problem, which goes back to the work of Dorfman (1943), we aim to
identify a small set of $ k\sim n^\theta $ infected individuals out of a population size $ n …
identify a small set of $ k\sim n^\theta $ infected individuals out of a population size $ n …
Statistical and computational phase transitions in group testing
A Coja-Oghlan, O Gebhard… - … on Learning Theory, 2022 - proceedings.mlr.press
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 …
individuals carrying a rare disease within a population of size n, based on the outcomes of …
Phase transitions in group testing
J Scarlett, V Cevher - Proceedings of the twenty-seventh annual ACM-SIAM …, 2016 - SIAM
The group testing problem consists of determining a sparse subset of a set of items that are
“defective” based on a set of possibly noisy tests, and arises in areas such as medical …
“defective” based on a set of possibly noisy tests, and arises in areas such as medical …
A compressed sensing approach to pooled RT-PCR testing for COVID-19 detection
We propose 'Tapestry', a single-round pooled testing method with application to COVID-19
testing using quantitative Reverse Transcription Polymerase Chain Reaction (RT-PCR) that …
testing using quantitative Reverse Transcription Polymerase Chain Reaction (RT-PCR) that …
Limits on support recovery with probabilistic models: An information-theoretic framework
J Scarlett, V Cevher - IEEE Transactions on Information Theory, 2016 - ieeexplore.ieee.org
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 …
that is relevant in generating a set of observations, and arises in a diverse range of settings …