arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0802.1406math.STstat.TH
收藏

FDR控制的两个简单充分条件

Two simple sufficient conditions for FDR control

Gilles Blanchard, Etienne Roquain

摘要:

我们表明,控制的错误发现率(FDR)的多重测试过程中隐含的两个耦合简单的充分条件。第一个,我们称之为“自一致性条件”,涉及算法本身,第二个,称为“依赖控制条件”,涉及对$p$ -值族的依赖假设。许多标准的多重测试程序是自洽的(例如,逐步上升,逐步下降或逐步上升下降的程序),我们证明了依赖控制条件可以满足时,选择相应的适当的拒绝功能,在三个经典类型的依赖:独立,积极的依赖(PRDS)和未指定的依赖。因此,我们恢复早期的结果,通过简单和统一的证明,同时将其范围扩展到几个方面:加权FDR,$p$值重新加权,新的家庭的步骤下未指定的$p$值的依赖性和自适应的步骤。我们给出了其他可能应用的其他示例。这个框架还允许定义和研究FDR控制多个测试程序在一个连续的,不可数的空间的假设。

英文摘要:

We show that the control of the false discovery rate (FDR) for a multiple testing procedure is implied by two coupled simple sufficient conditions. The first one, which we call ``self-consistency condition'', concerns the algorithm itself, and the second, called ``dependency control condition'' is related to the dependency assumptions on the $p$-value family. Many standard multiple testing procedures are self-consistent (e.g. step-up, step-down or step-up-down procedures), and we prove that the dependency control condition can be fulfilled when choosing correspondingly appropriate rejection functions, in three classical types of dependency: independence, positive dependency (PRDS) and unspecified dependency. As a consequence, we recover earlier results through simple and unifying proofs while extending their scope to several regards: weighted FDR, $p$-value reweighting, new family of step-up procedures under unspecified $p$-value dependency and adaptive step-up procedures. We give additional examples of other possible applications. This framework also allows for defining and studying FDR control for multiple testing procedures over a continuous, uncountable space of hypotheses.

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

↑