Metropolized Knockoff Sampling
Not on the map. Why?
Abstract (arXiv)
Model-X knockoffs is a wrapper that transforms essentially any feature importance measure into a variable selection algorithm, which discovers true effects while rigorously controlling the expected fraction of false positives. A frequently discussed challenge to apply this method is to construct knockoff variables, which are synthetic variables obeying a crucial exchangeability property with the explanatory variables under study. This paper introduces techniques for knockoff generation in great generality: we provide a sequential characterization of all possible knockoff distributions, which leads to a Metropolis-Hastingsformulation of an exact knockoff sampler. We further show how to use conditional independence structure to speed up computations. Combining these two threads, we introduce an explicit set of sequential algorithms and empirically demonstrate their effectiveness. Our theoretical analysis proves that our algorithms achieve near-optimal computational complexity in certain cases. The techniques we develop are sufficiently rich to enable knockoff sampling in challenging models including cases where the covariates are continuous and heavy-tailed, and follow a graphical model such as the Ising model.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 1 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 1; 2025: 3; 2026: 2.
10 papers.
- 2022Conditional Feature Importance for Mixed Datacited by 7
- 2021Normalizing Flows for Knockoff-free Controlled Feature Selectioncited by 5
- 2022GRASP: A Goodness-of-Fit Test for Classification Learningcited by 1
- 2025Knoop: Practical Enhancement of Knockoff with Over-Parameterization for Variable Selectioncited by 1
- 2025Provable FDR Control for Deep Feature Selection: Deep MLPs and Beyondcited by 1
- 2023The Conditional Prediction Function: A Novel Technique to Control False Discovery Rate for Complex Modelscited by 0
- 2024CatNet: Controlling the False Discovery Rate in LSTM with SHAP Feature Importance and Gaussian Mirrorscited by 0
- 2025AICO: Feature Significance Tests for Supervised Learningcited by 0
- 2026Virtual Dummies: Enabling Scalable FDR-Controlled Variable Selection via Sequential Sampling of Null Featurescited by 0
- 2026Model-Agnostic FDR Control via Group Gaussian Mirror and Permutation SHAPcited by 0
- 2026Model-Agnostic FDR Control via Group Gaussian Mirror and Permutation SHAP2 Aug 2026
- 2026Virtual Dummies: Enabling Scalable FDR-Controlled Variable Selection via Sequential Sampling of Null Features8 Apr 2026
- 2025Provable FDR Control for Deep Feature Selection: Deep MLPs and Beyond4 Dec 2025
- 2025AICO: Feature Significance Tests for Supervised Learning29 Jun 2025
- 2025Knoop: Practical Enhancement of Knockoff with Over-Parameterization for Variable Selection28 Jan 2025
- 2024CatNet: Controlling the False Discovery Rate in LSTM with SHAP Feature Importance and Gaussian Mirrors25 Nov 2024
- 2023The Conditional Prediction Function: A Novel Technique to Control False Discovery Rate for Complex Models7 Oct 2023
- 2022Conditional Feature Importance for Mixed Data6 Oct 2022
- 2022GRASP: A Goodness-of-Fit Test for Classification Learning5 Sep 2022
- 2021Normalizing Flows for Knockoff-free Controlled Feature Selection3 Jun 2021