一种通过随机化和镜像统计量实现假发现率控制与功效最大化的计算高效方法
A Computationally Efficient Approach to False Discovery Rate Control and Power Maximisation via Randomisation and Mirror Statistic
AI总结:
本文提出将镜像统计量与结果随机化相结合,在高维回归中控制假发现率并提升变量选择功效,同时保持计算高效且可扩展至极高维问题。
摘要:
在高维回归模型中同时进行变量选择与统计推断,是统计学和机器学习中一个尚未解决的挑战。随着海量变量日益可得,需要采用专门的统计程序,在高维空间中准确选择最重要的预测变量,同时控制与变量选择程序相关的假发现率(FDR)。本文提出联合采用镜像统计量(Mirror Statistic)方法进行FDR控制,并结合结果随机化(outcome randomisation)以最大化变量选择程序的统计功效,该功效通过真阳性率来衡量。通过大量模拟,我们展示了所提策略如何结合两种技术的优势。镜像统计量是一种灵活的FDR控制方法,仅需较弱的模型假设,但需要两组独立的回归系数估计,通常通过对原始数据集进行拆分获得。结果随机化是数据拆分的一种替代方案,能够生成两个独立的结果,进而用于估计构建镜像统计量所需的系数。这两种方法的结合在多种场景下提供了更高的检验功效,例如高度相关的协变量和高比例活跃变量的情形。此外,该方法可扩展到极高维问题,因为算法内存占用低,并且只需在完整数据集上运行一次,不同于多次数据拆分等迭代式替代方案。
英文摘要:
Simultaneously performing variable selection and inference in high-dimensional regression models is an open challenge in statistics and machine learning. The increasing availability of vast amounts of variables requires the adoption of specific statistical procedures to accurately select the most important predictors in a high-dimensional space, while controlling the false discovery rate (FDR) associated with the variable selection procedure. In this paper, we propose the joint adoption of the Mirror Statistic approach to FDR control, coupled with outcome randomisation to maximise the statistical power of the variable selection procedure, measured through the true positive rate. Through extensive simulations, we show how our proposed strategy allows us to combine the benefits of the two techniques. The Mirror Statistic is a flexible method to control FDR, which only requires mild model assumptions, but requires two sets of independent regression coefficient estimates, usually obtained after splitting the original dataset. Outcome randomisation is an alternative to data splitting that allows to generate two independent outcomes, which can then be used to estimate the coefficients that go into the construction of the Mirror Statistic. The combination of these two approaches provides increased testing power in a number of scenarios, such as highly correlated covariates and high percentages of active variables. Moreover, it is scalable to very high-dimensional problems, since the algorithm has a low memory footprint and only requires a single run on the full dataset, as opposed to iterative alternatives such as multiple data splitting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。