# Knockoffs for the mass: new feature importance statistics with false discovery guarantees

arXiv: https://arxiv.org/abs/1807.06214 · HTML: https://mlsanity.com/paper/1807.06214/

## Key facts

- Cited by 11 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Jul 2018.

## Built on by (most cited first, 11 of 11)

- [Knockoff-Guided Feature Selection via A Single Pre-trained Reinforced Agent](https://mlsanity.com/paper/2403.04015/) (2024)
- [Model-X Sequential Testing for Conditional Independence via Testing by Betting](https://mlsanity.com/paper/2210.00354/) (2022)
- [Normalizing Flows for Knockoff-free Controlled Feature Selection](https://mlsanity.com/paper/2106.01528/) (2021)
- [Time Series Causal Link Estimation under Hidden Confounding using Knockoff Interventions](https://mlsanity.com/paper/2209.11497/) (2022)
- [Causal Discovery using Model Invariance through Knockoff Interventions](https://mlsanity.com/paper/2207.04055/) (2022)
- [Causal Inference in Non-linear Time-series using Deep Networks and Knockoff Counterfactuals](https://mlsanity.com/paper/2109.10817/) (2021)
- [Beyond Importance Scores: Interpreting Tabular ML by Visualizing Feature Semantics](https://mlsanity.com/paper/2111.05898/) (2021)
- [Learning to Increase the Power of Conditional Randomization Tests](https://mlsanity.com/paper/2207.01022/) (2022)
- [Concept-based Explanations using Non-negative Concept Activation Vectors and Decision Tree for CNN Models](https://mlsanity.com/paper/2211.10807/) (2022)
- [DeepDRK: Deep Dependency Regularized Knockoff for Feature Selection](https://mlsanity.com/paper/2402.17176/) (2024)
- [Automatic Concept Embedding Model (ACEM): No train-time concepts, No issue!](https://mlsanity.com/paper/2309.03970/) (2023)

## Abstract (arXiv)

An important problem in machine learning and statistics is to identify features that causally affect the outcome. This is often impossible to do from purely observational data, and a natural relaxation is to identify features that are correlated with the outcome even conditioned on all other observed features. For example, we want to identify that smoking really is correlated with cancer conditioned on demographics. The knockoff procedure is a recent breakthrough in statistics that, in theory, can identify truly correlated features while guaranteeing that the false discovery is limited. The idea is to create synthetic data -- knockoffs -- that captures correlations amongst the features. However there are substantial computational and practical challenges to generating and using knockoffs. This paper makes several key advances that enable knockoff application to be more efficient and powerful. We develop an efficient algorithm to generate valid knockoffs from Bayesian Networks. Then we systematically evaluate knockoff test statistics and develop new statistics with improved power. The paper combines new mathematical guarantees with systematic experiments on real and synthetic data.
