arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.06413stat.MEcs.LGmath.PRstat.ML
收藏

Crackovid:优化组测试

Crackovid: Optimizing Group Testing

Louis Abraham, Gary Bécigneul, Bernhard Schölkopf

摘要:

我们研究了在COVID-19背景下通常被称为群体测试的问题。鉴于$n$样本取自患者,我们应如何选择待检测样本的混合物,以最大限度地获取信息并减少检测次数?我们考虑自适应和非自适应的策略,并采取贝叶斯方法与前两个感染的患者和测试错误。我们首先提出了一个数学原则的目标,在信息论的基础上。然后,我们使用遗传算法优化非自适应优化策略,并利用自适应子模块化的数学框架,以获得理论保证的贪婪自适应方法。

英文摘要:

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 non-adaptive optimization strategies using genetic algorithms, and leverage the mathematical framework of adaptive sub-modularity to obtain theoretical guarantees for the greedy-adaptive method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑