• Corpus ID: 218613916

Crackovid: Optimizing Group Testing

  title={Crackovid: Optimizing Group Testing},
  author={Louis Abraham and Gary B{\'e}cigneul and Bernhard Sch{\"o}lkopf},
We study the problem usually referred to as group testing in the context of COVID-19. Given $n$ samples taken from patients, how should we select mixtures of samples to be tested, so as to maximize information and minimize the number of tests? We consider both adaptive and non-adaptive strategies, and take a Bayesian approach with a prior both for infection of patients and test errors. We start by proposing a mathematically principled objective, grounded in information theory. We then optimize… 

Noisy Adaptive Group Testing via Noisy Binary Search

This paper introduces noisy group testing algorithms that apply noisy binary search as a subroutine and provides three variations of this approach with increasing complexity, culminating in an algorithm that succeeds using a number of tests that matches the best known previously.

Listening to bluetooth beacons for epidemic risk mitigation

A new privacy-preserving and inclusive system for epidemic risk assessment and notification that aims to address the above limitations and can provide significantly higher sensitivity and specificity than existing app-based systems.



Non-adaptive Group Testing in the Presence of Errors

Graph-Constrained Group Testing

A variation of group testing problems on graphs, motivated by applications in network tomography, sensor networks and infection propagation, is formulated and it is shown that m = O(d3 log3 n) nonadaptive tests are sufficient to identify d defective items.

Nonadaptive Group Testing With Random Set of Defectives

  • A. Mazumdar
  • Computer Science
    IEEE Transactions on Information Theory
  • 2016
This paper considers the scenario where defective items are random and follow simple probability distributions, and goes beyond the minimum distance analysis and connects the average distance of a constant weight code to the parameters of the resulting test matrix.

FACT- Frankfurt adjusted COVID-19 testing- a novel method enables high-throughput SARS-CoV-2 screening without loss of sensitivity

The proposed FACT- protocol did not cause a significant loss in analytic or diagnostic sensitivity compared to single sample testing in multiple setups, and it reduced the amount of reagents needed by up to 40%, and also reduced hands-on time.

Non-adaptive group testing: Explicit bounds and novel algorithms

Inspired by compressive sensing algorithms, four novel computationally efficient decoding algorithms for group testing are introduced, CBP via Linear Programming (CBP-LP), NCBP- LP (Noisy CBP-LP, and the two related algorithmsNCBP-SLP+ and NCBP -SLP- (“Simple” NC BP-LP).

Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization

It is proved that if a problem satisfies adaptive submodularity, a simple adaptive greedy algorithm is guaranteed to be competitive with the optimal policy, providing performance guarantees for both stochastic maximization and coverage.

Optimal speedup of Las Vegas algorithms

The authors describe a simple universal strategy S/sup univ/, with the property that, for any algorithm A, T(A,S/Sup univ/)=O (l/sub A/log(l/ sub A/)), which is the best performance that can be achieved, up to a constant factor, by any universal strategy.

Enhancing the Number of Lab Tests with a “poisoned Wine” Approach

Two complementary approaches are proposed to enhance processing large amounts of collected samples based on mixing samples in testing cups as opposed to testing single samples in each cup, which can boost the number of tests and reduce the effective testing time.

Elements of Information Theory

The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.

Near-optimal sensor placements in Gaussian processes

A mutual information criteria is proposed, and it is proved that finding the configuration that maximizes mutual information is NP-complete, and a polynomial-time approximation is described that is within (1 -- 1/e) of the optimum by exploiting the submodularity of the criterion.