Papers › Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selection

Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selection

7 Oct 2016arXiv:1610.02351links table onlyarchive 2025-07-28

Emmanuel Candes, Yingying Fan, Lucas Janson, Jinchi Lv

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Many contemporary large-scale applications involve building interpretable models linking a large set of potential covariates to a response in a nonlinear fashion, such as when the response is binary. Although this modeling problem has been extensively studied, it remains unclear how to effectively control the fraction of false discoveries even in high-dimensional logistic regression, not to mention general high-dimensional nonlinear models. To address such a practical problem, we propose a new framework of model-X knockoffs, which reads from a different perspective the knockoff procedure (Barber and Cand\`es, 2015) originally designed for controlling the false discovery rate in linear models. Whereas the knockoffs procedure is constrained to homoscedastic linear models with n≥p, the key innovation here is that model-X knockoffs provide valid inference from finite samples in settings in which the conditional distribution of the response is arbitrary and completely unknown. Furthermore, this holds no matter the number of covariates. Correct inference in such a broad setting is achieved by constructing knockoff variables probabilistically instead of geometrically. To do this, our approach requires the covariates be random (independent and identically distributed rows) with a distribution that is known, although we provide preliminary experimental evidence that our procedure is robust to unknown/estimated distributions. To our knowledge, no other procedure solves the controlled variable selection problem in such generality, but in the restricted settings where competitors exist, we demonstrate the superior power of knockoffs through simulations. Finally, we apply our procedure to data from a case-control study of Crohn's disease in the United Kingdom, making twice as many discoveries as the original analysis of the same data.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1610.02351")

Code

Syntology Ran 0 of 24 code samples harvested from 1 repository linked to this paper; 24 have no recorded run.

By repository: community (archive-listed): 24 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

amspector100/knockpy mentioned on GitHubpytorchMIT report
rajesh-lab/ddlk mentioned on GitHubpytorchAGPL-3.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

24 samples harvested; 0 ran; 0 honoured the contract we drafted; 24 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

24unverified

Licence: 0 of the 24 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from amspector100/knockpy. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

DirichletCorr amspector100/knockpy/knockpy/dgp.py community (archive-listed) unverified MIT (permissive) · da14134814dc0e78 · report
UniformDot amspector100/knockpy/knockpy/dgp.py community (archive-listed) unverified MIT (permissive) · 90012e7ae0e81f67 · report
Wishart amspector100/knockpy/knockpy/dgp.py community (archive-listed) unverified MIT (permissive) · d72098be902237e9 · report
calc_group_sizes amspector100/knockpy/knockpy/utilities.py community (archive-listed) unverified MIT (permissive) · adc23ee77dec077a · report
calc_mse amspector100/knockpy/knockpy/knockoff_stats.py community (archive-listed) unverified MIT (permissive) · aefd4b54e9f03113 · report
cholupdate amspector100/knockpy/knockpy/mrc.py community (archive-listed) unverified MIT (permissive) · 5458ec42b388ef4f · report
compute_ggm_threshold amspector100/knockpy/knockpy/ggm.py community (archive-listed) unverified MIT (permissive) · 57e1e9e9cc014bfb · report
create_batches amspector100/knockpy/knockpy/kpytorch/deeppink.py community (archive-listed) unverified MIT (permissive) · 746a83193745ebea · report
discovered_edges amspector100/knockpy/knockpy/ggm.py community (archive-listed) unverified MIT (permissive) · 420aa22ddd8ec2dd · report
divide_computation amspector100/knockpy/knockpy/smatrix.py community (archive-listed) unverified MIT (permissive) · 59022b18d4ea7f9c · report
fetch_group_nonnulls amspector100/knockpy/knockpy/utilities.py community (archive-listed) unverified MIT (permissive) · 90ca0e3347784798 · report
gaussian_log_likelihood amspector100/knockpy/knockpy/metro.py community (archive-listed) unverified MIT (permissive) · ce1e7a9ba67294a2 · report
get_ordering amspector100/knockpy/knockpy/metro.py community (archive-listed) unverified MIT (permissive) · 7cea7af4558ec0ff · report
merge_groups amspector100/knockpy/knockpy/smatrix.py community (archive-listed) unverified MIT (permissive) · b135d8a164d09c72 · report
mvr_loss amspector100/knockpy/knockpy/mrc.py community (archive-listed) unverified MIT (permissive) · ec3479c58d959f97 · report
parse_logistic_flag amspector100/knockpy/knockpy/knockoff_stats.py community (archive-listed) unverified MIT (permissive) · 9d353e743b90dcec · report
parse_method amspector100/knockpy/knockpy/smatrix.py community (archive-listed) unverified MIT (permissive) · f25da86a45abedd6 · report
parse_y_dist amspector100/knockpy/knockpy/knockoff_stats.py community (archive-listed) unverified MIT (permissive) · 96949d6294410a08 · report
preprocess_groups amspector100/knockpy/knockpy/utilities.py community (archive-listed) unverified MIT (permissive) · 89a86b326fa4a15d · report
produce_FX_knockoffs amspector100/knockpy/knockpy/knockoffs.py community (archive-listed) unverified MIT (permissive) · be4d3e6ef956e7e3 · report
produce_MX_gaussian_knockoffs amspector100/knockpy/knockpy/knockoffs.py community (archive-listed) unverified MIT (permissive) · 69bdab92b1aba81b · report
solve_mvr_factored amspector100/knockpy/knockpy/mrc.py community (archive-listed) unverified MIT (permissive) · 9069f8af21c2d20d · report
t_log_likelihood amspector100/knockpy/knockpy/metro.py community (archive-listed) unverified MIT (permissive) · 4a5aafb88e81d20d · report
train_deeppink amspector100/knockpy/knockpy/kpytorch/deeppink.py community (archive-listed) unverified MIT (permissive) · a0f72bcdefa8751d · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections