Controlling the false discovery rate via knockoffs
通过 Knockoff 变量控制错误发现率AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦通用线性模型的多重筛选与错误发现率,未提供所列细分领域的直接依据。
通过 Knockoff 变量控制错误发现率AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
In many fields of science, we observe a response variable together with a large number of potential explanatory variables, and would like to be able to discover which variables are truly associated with the response. At the same time, we need to know that the false discovery rate (FDR)—the expected fraction of false discoveries among all discoveries—is not too high, in order to assure the scientist that most of the discoveries are indeed true and replicable. This paper introduces the knockoff filter, a new variable selection procedure controlling the FDR in the statistical linear model whenever there are at least as many observations as variables. This method achieves exact FDR control in finite sample settings no matter the design or covariates, the number of variables in the model, or the amplitudes of the unknown regression coefficients, and does not require any knowledge of the noise level. As the name suggests, the method operates by manufacturing knockoff variables that are cheap—their construction does not require any new data—and are designed to mimic the correlation structure found within the existing variables, in a way that allows for accurate FDR control, beyond what is possible with permutation-based methods. The method of knockoffs is very general and flexible, and can work with a broad class of test statistics. We test the method in combination with statistics from the Lasso for sparse regression, and obtain empirical results showing that the resulting method has far more power than existing selection rules when the proportion of null variables is high.
高维线性回归的统一谱分析:去偏与阈值化
We use spectral analysis to establish a unified theory of debiasing, thresholding, and simultaneous inference for high-dimensional linear regression with ill-conditioned designs. The methods include Ridge regression, spectral cut-off, and iterative and dynamical regression procedures. A common debiasing procedure uses two applications of the original linear algorithm with fixed parameters. Spectral analysis shows that debiasing squares the residual, while implementations…
面向超高维数据的贝叶斯单变量引导稀疏回归
Ultra-high-dimensional genomic studies require simultaneous identification of sparse signals, control of spurious discoveries, and computationally feasible inference when the number of predictors can reach hundreds of thousands or more. We propose Bayesian Univariate-Guided Sparse Regression (BUGS), a global--local shrinkage framework that incorporates marginal association information directly into the prior through continuous modulation of shrinkage. By embedding univariate…
基于残差化 Walsh–Hadamard 得分的异质析因效应修饰因子去偏与同时推断
In factorial randomized experiments with $K$ binary treatment components, we study which baseline covariates modify component main effects and interactions. We define effect-modifier cells $(j,S)$, $j\in[p]$ and $\emptyset\neq S\subseteq[K]$, through the coefficients $θ^\ast_{jS}$ of population linear projections of conditional Walsh--Hadamard contrasts $τ_{S}$ onto standardized covariates. Using baseline-robust direct scores, we develop frequentist inference for all $p(2^K-1)$…
预测变量相关下基于自适应虚拟变量的可扩展变量选择
Reliable high-dimensional variable selection requires scalable error-controlling methods. The Terminating-Random Experiments (T-Rex) selector estimates the false discovery rate (FDR) by aggregating early-terminated forward-selection paths in which predictors compete with synthetic dummies. We address two remaining challenges: i) predictor dependence can bias dummy-predictor competition; ii) computation is wasted on recomputing terms shared across experiments. Building on…
条件分位数限制识别参数的一致推断
Many structural and dynamic economic models imply that key parameters are identified by conditional quantile restrictions. Building on the exponential-weighting approach of Bierens (1990) and recent advances in penalized maximum statistics for conditional moment restrictions (Chen et al., 2025), we develop a unified inference framework for such parameters. We propose an adaptive $\ell_1$-penalized supremum statistic that transforms the conditional restriction into a…
通过汤普森采样实现探索驱动的迭代稀疏半定规划聚类
High-dimensional sparse clustering is a challenging combinatorial problem due to the tight coupling between cluster assignment and variable selection. We demonstrate that semidefinite programming (SDP) relaxation of K-means is robust to variable over-selection by establishing minimax separation bounds. Leveraging this robustness, we offer a twist on the recent trend of using exogenous randomness to evaluate feature importance and control false discovery by partially shifting…