RANK: Large-Scale Inference with Graphical Nonlinear Knockoffs
Not on the map. Why?
Abstract (arXiv)
Power and reproducibility are key to enabling refined scientific discoveries in contemporary big data applications with general high-dimensional nonlinear models. In this paper, we provide theoretical foundations on the power and robustness for the model-free knockoffs procedure introduced recently in Cand`es, Fan, Janson and Lv (2016) in high-dimensional setting when the covariate distribution is characterized by Gaussian graphical model. We establish that under mild regularity conditions, the power of the oracle knockoffs procedure with known covariate distribution in high-dimensional linear models is asymptotically one as sample size goes to infinity. When moving away from the ideal case, we suggest the modified model-free knockoffs method called graphical nonlinear knockoffs (RANK) to accommodate the unknown covariate distribution. We provide theoretical justifications on the robustness of our modified procedure by showing that the false discovery rate (FDR) is asymptotically controlled at the target level and the power is asymptotically one with the estimated covariate distribution. To the best of our knowledge, this is the first formal theoretical result on the power for the knockoffs procedure. Simulation results demonstrate that compared to existing approaches, our method performs competitively in both FDR control and power. A real data set is analyzed to further assess the performance of the suggested knockoffs procedure.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Aug 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
6 papers.
- 2023Sequential Knockoffs for Variable Selection in Reinforcement Learningcited by 7
- 2021Normalizing Flows for Knockoff-free Controlled Feature Selectioncited by 5
- 2021Directional FDR Control for Sub-Gaussian Sparse GLMscited by 2
- 2024DeepLINK-T: deep learning inference for time series data using knockoffs and LSTMcited by 2
- 2022Error-based Knockoffs Inference for Controlled Feature Selectioncited by 1
- 2025Sparse minimum Redundancy Maximum Relevance for feature selectioncited by 0
- 2025Sparse minimum Redundancy Maximum Relevance for feature selection26 Aug 2025
- 2024DeepLINK-T: deep learning inference for time series data using knockoffs and LSTM5 Apr 2024
- 2023Sequential Knockoffs for Variable Selection in Reinforcement Learning24 Mar 2023
- 2022Error-based Knockoffs Inference for Controlled Feature Selection9 Mar 2022
- 2021Normalizing Flows for Knockoff-free Controlled Feature Selection3 Jun 2021
- 2021Directional FDR Control for Sub-Gaussian Sparse GLMs2 May 2021