arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.12653cs.ITmath.IT
收藏

具有逆向扰动测量的非自适应组合定量分组测试

Non-adaptive Combinatorial Quantitative Group Testing with Adversarially Perturbed Measurements

Yun-Han Li, I-Hsiang Wang

摘要:

研究了测量值有噪声时的组合定量分组测试问题。QGT的目标是通过计数测量从大小为$n$的数据集中检测缺陷项,每个计数测量对选定项池中的缺陷数量进行计数。虽然大多数文献考虑随机噪声的概率QGT或无噪声测量的组合QGT,我们的重点是组合QGT与噪声测量,可能会受到不利扰动的加性有界噪声。由于完美的检测是不可能的,采用部分检测标准。对抗性噪声被约束的$d_n = Θ(n^δ)$和检测标准是确保不超过$k_n = Θ(n^κ)$错误可以作出,我们的目标是表征的基本限制的测量,称为\emph{pooling complexity}的数量,以及提供明确的建设测量计划与最佳池的复杂性和有效的解码算法。我们首先表明,当$0<2δ\leq κ<1$时,对于非自适应设置,基本限制是$\frac{1}{1-2δ}\frac{n}{\log n}$在一个不依赖于$(n,κ,δ)$的常数因子内,锐化了Chen和Wang [2]的先前结果。我们还提供了一个明确的建设一个非自适应确定性测量计划与$\frac{1}{1-2δ}\frac{n}{\log_{2} n}$池复杂度高达一个常数的因素,匹配的基本限制,与解码复杂度为$o(n^{1+ρ})$为所有$ρ> 0$,几乎线性的$n$,数据集的大小。

英文摘要:

In this paper, combinatorial quantitative group testing (QGT) with noisy measurements is studied. The goal of QGT is to detect defective items from a data set of size $n$ with counting measurements, each of which counts the number of defects in a selected pool of items. While most literatures consider either probabilistic QGT with random noise or combinatorial QGT with noiseless measurements, our focus is on the combinatorial QGT with noisy measurements that might be adversarially perturbed by additive bounded noises. Since perfect detection is impossible, a partial detection criterion is adopted. With the adversarial noise being bounded by $d_n = Θ(n^δ)$ and the detection criterion being to ensure no more than $k_n = Θ(n^κ)$ errors can be made, our goal is to characterize the fundamental limit on the number of measurement, termed \emph{pooling complexity}, as well as provide explicit construction of measurement plans with optimal pooling complexity and efficient decoding algorithms. We first show that the fundamental limit is $\frac{1}{1-2δ}\frac{n}{\log n}$ to within a constant factor not depending on $(n,κ,δ)$ for the non-adaptive setting when $0<2δ\leq κ<1$, sharpening the previous result by Chen and Wang [2]. We also provide an explicit construction of a non-adaptive deterministic measurement plan with $\frac{1}{1-2δ}\frac{n}{\log_{2} n}$ pooling complexity up to a constant factor, matching the fundamental limit, with decoding complexity being $o(n^{1+ρ})$ for all $ρ> 0$, nearly linear in $n$, the size of the data set.

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

↑