arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.10018cs.ITmath.ITq-bio.QMstat.AP
收藏

两阶段解码算法及具有先验统计的群体测试界

Two-Stage Decoding Algorithm and Bounds for Group Testing with Prior Statistics

Technion(以色列理工学院);Princeton University(普林斯顿大学)

Ayelet C. Portnoy, Amit Solomon, Alejandro Cohen

AI总结:

本文提出了一种高效的两阶段解码算法,用于具有相关先验统计的群体测试,通过减少测试数量并提高效率实现最优性能。

摘要:

在本文中,我们提出了一种高效的两阶段解码算法,用于具有通用相关先验统计的非适应性群体测试(GT)。所提出的解决方案可以应用于任何以树状图表示的相关统计先验,例如有限状态机和马尔可夫过程。我们引入了列表维特比算法(LVA)的一种变体,以实现使用比目标更少的测试次数来准确恢复,这有效利用了相关先验统计结构。我们还提供了一个充分界,以确定任何具有任意相关性的最大后验(MAP)解码器所需的混合测试数量,即感染项目之间的依赖性。我们的数值结果表明,所提出的两阶段解码GT(2SDGT)算法可以在实际情况下以可行的复杂度获得最优的MAP性能,例如在新冠疫情期间和稀疏信号恢复应用中,并且在测试的场景中,将混合测试的数量减少了至少25%相比现有的经典低复杂度GT算法。此外,我们分析性地刻画了所提出的2SDGT算法的复杂度,以保证其效率。

英文摘要:

In this paper, we propose an efficient two-stage decoding algorithm for non-adaptive Group Testing (GT) with general correlated prior statistics. The proposed solution can be applied to any correlated statistical prior represented in trellis, e.g., finite state machines and Markov processes. We introduce a variation of List Viterbi Algorithm (LVA) to enable accurate recovery using much fewer tests than objectives, which efficiently gains from the correlated prior statistics structure. We also provide a sufficiency bound to the number of pooled tests required by any Maximum A Posteriori (MAP) decoder with an arbitrary correlation, i.e., dependence between infected items. Our numerical results demonstrate that the proposed two-stage decoding GT (2SDGT) algorithm can obtain the optimal MAP performance with feasible complexity in practical regimes, such as with COVID-19 and sparse signal recovery applications, and reduce in the scenarios tested the number of pooled tests by at least $25\%$ compared to existing classical low complexity GT algorithms. Moreover, we analytically characterize the complexity of the proposed 2SDGT algorithm that guarantees its efficiency.

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

↑