Group testing is a technique which avoids individually testing $n$ samples for a rare disease and instead tests $n < p$ pools, where a pool consists of a mixture of small, equal portions of a subset of the $p$ samples. Group testing saves testing time and resources in many applications, including RT-PCR, with guarantees for the recovery of the status of the $p$ samples from results on $n$ pools. The noise in quantitative RT- PCR is inherently known to follow a multiplicative data-dependent model. In recent literature, the corresponding linear systems for inferring the health status of $p$ samples from results on $n$ pools have been solved using the Lasso estimator and its variants, which have been typically used in additive Gaussian noise settings. There is no existing literature which establishes performance bounds for Lasso for the multiplicative noise model associated with RT-PCR. After noting that a recent general technique, Hunt et al., works for Poisson inverse problems, we adapt it to handle sparse signal reconstruction from compressive measurements with multiplicative noise: we present high probability performance bounds and data-dependent weights for the Lasso and its weighted version. We also show numerical results on simulated pooled RT-PCR data to empirically validate our bounds.

翻译：群检测是一种避免对$n$个样本逐一检测罕见疾病的技术，而是检测$n < p$个混合池，每个混合池由$p$个样本子集中等量小份混合而成。群检测在包括RT-PCR在内的许多应用中可节省检测时间和资源，并能从$n$个混合池的结果中保证恢复$p$个样本的状态。定量RT-PCR中的噪声固有地遵循乘性数据依赖模型。近期文献中，用于从$n$个混合池结果推断$p$个样本健康状态的相应线性系统已采用Lasso估计器及其变体求解，这些方法通常用于加性高斯噪声设置。目前尚无文献建立针对RT-PCR乘性噪声模型的Lasso性能界。注意到Hunt等人近期提出的一种通用技术适用于泊松逆问题后，我们将其改进以处理乘性噪声下的压缩测量稀疏信号重建：我们给出了Lasso及其加权版本的高概率性能界和数据依赖权重。通过模拟混合RT-PCR数据的数值结果，我们实证验证了所提出的界。