A knockoff filter for high-dimensional selective inference
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
This paper develops a framework for testing for associations in a possibly high-dimensional linear model where the number of features/variables may far exceed the number of observational units. In this framework, the observations are split into two groups, where the first group is used to screen for a set of potentially relevant variables, whereas the second is used for inference over this reduced set of variables; we also develop strategies for leveraging information from the first part of the data at the inference step for greater power. In our work, the inferential step is carried out by applying the recently introduced knockoff filter, which creates a knockoff copy—a fake variable serving as a control—for each screened variable. We prove that this procedure controls the directional false discovery rate (FDR) in the reduced model controlling for all screened variables; this says that our high-dimensional knockoff procedure “discovers” important variables as well as the directions (signs) of their effects, in such a way that the expected proportion of wrongly chosen signs is below the user-specified level (thereby controlling a notion of Type S error averaged over the selected set). This result is nonasymptotic, and holds for any distribution of the original features and any values of the unknown regression coefficients, so that inference is not calibrated under hypothesized values of the effect sizes. We demonstrate the performance of our general and flexible approach through numerical studies, showing more power than existing alternatives. Finally, we apply our method to a genome-wide association study to find locations on the genome that are possibly associated with a continuous phenotype.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing
Benjamini, Y., & Hochberg, Y. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02031.x · Cited by 109,482
Principal components analysis corrects for stratification in genome-wide association studies
Price, A. L., Patterson, N. J., Plenge, R. M., Weinblatt, M. E., Shadick, N. A., & Reich, D. (2006) · Nature Genetics · doi:10.1038/ng1847 · Cited by 10,248 · cited 1×
“[26] Alkes L Price, Nick J Patterson, Robert M Plenge, Michael E Weinblatt, Nancy A Shadick, and David Reich.”
BackgroundWiller (2013) · doi:10.1038/ng.2797 · Cited by 2,983
The Philosophy of Multiple Comparisons
Tukey, J. W. (1991) · Statistical Science · doi:10.1214/ss/1177011945 · Cited by 773
False Discovery Rate–Adjusted Multiple Confidence Intervals for Selected Parameters
Benjamini, Y., & Yekutieli, D. (2005) · Journal of the American Statistical Association · doi:10.1198/016214504000001907 · Cited by 671 · cited 3×
“To measure our success at selecting only those effects that are large enough to be meaningfully distinguished from noise, we might like to control the mixed directional false discovery rate (FDRdir) [28, 6] defined as follows: letting Ŝ ⊂ {1, .”
BackgroundA significance test for the lasso
Lockhart, R., Taylor, J., Tibshirani, R. J., & Tibshirani, R. (2014) · The Annals of Statistics · doi:10.1214/13-aos1175 · Cited by 541
Type S error rates for classical and Bayesian single and multiple comparison procedures
Gelman, A., & Tuerlinckx, F. (2000) · Computational Statistics · doi:10.1007/s001800000040 · Cited by 380 · cited 2×
“[12] Andrew Gelman and Francis Tuerlinckx.”
Background
Cited by
Fair Regression with Wasserstein Barycenters
Chzhen, E., Denis, C., Hebiri, M., Oneto, L., & Pontil, M. (2020) · arXiv · doi:10.48550/arxiv.2006.07286 · Cited by 46
“Similar proof techniques are also used in randomization inference via permutations [18, 21], conformal prediction [30, 42], knockoff estimation [4] to name a few.”
Method
Metadata
- Authors
- Barber, R. F., & Candès, E. J.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2019-10-01
- Volume
- 47
- Issue
- 5
- Pages
- 2504-2537
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2256505134
- Cited by
- 178
- References
- 7
- FWCI
- 16.66
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.