采样与转发:网络中错误发现率的通信高效控制
Sample-and-Forward: Communication-Efficient Control of the False Discovery Rate in Networks
AI总结:
提出采样与转发方法,在通信受限网络中高效控制错误发现率,仅需少量样本和少量比特通信即可实现有限样本FDR控制及竞争性检测功效。
摘要:
本研究关注在通信约束下控制网络中的错误发现率(FDR)。我们提出了一种采样与转发方法,这是Benjamini-Hochberg(BH)过程的一种灵活且通信高效的版本,适用于具有一般拓扑结构的多跳网络。我们的方法表明,网络中的节点无需相互通信p值,即可在全球FDR控制约束下实现可观的统计功效。考虑一个总共有$m$个p值的网络,我们的方法首先在每个节点对p值的(经验)累积分布函数进行采样,然后向其邻居转发$\mathcal{O}(\log m)$比特。在与原始BH过程相同的假设下,我们的方法既具有可证明的有限样本FDR控制,又具有竞争力的经验检测功效,即使每个节点只有少量样本。我们在p值的混合模型假设下提供了功效的渐近分析。
英文摘要:
This work concerns controlling the false discovery rate (FDR) in networks under communication constraints. We present sample-and-forward, a flexible and communication-efficient version of the Benjamini-Hochberg (BH) procedure for multihop networks with general topologies. Our method evidences that the nodes in a network do not need to communicate p-values to each other to achieve a decent statistical power under the global FDR control constraint. Consider a network with a total of $m$ p-values, our method consists of first sampling the (empirical) CDF of the p-values at each node and then forwarding $\mathcal{O}(\log m)$ bits to its neighbors. Under the same assumptions as for the original BH procedure, our method has both the provable finite-sample FDR control as well as competitive empirical detection power, even with a few samples at each node. We provide an asymptotic analysis of power under a mixture model assumption on the p-values.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。