a common problem in modern statistical applications is to select, from a large set of candidates, a subset of variables which are important for determining an outcome of interest. for instance, the outcome may be disease status and the variables may be hundreds of thousands of single nucleotide polymorphisms on the genome. for data coming from low-dimensional ($n \ge p$) linear homoscedastic models, the knockoff procedure recently introduced by barber and cand\'es solves the problem by performing variable selection while controlling the false discovery rate (fdr). in this talk i will discuss an extension of the knockoff framework to arbitrary (and unknown) conditional models and any dimensions, including $n < p$, allowing it to solve a much broader array of problems. this extension requires the design matrix be random (independent and identically distributed rows) with a covariate distribution that is known, although the procedure appears to be robust to unknown/estimated distributions. no other procedure solves the variable selection problem in such generality, but in the restricted settings where competitors exist, i will demonstrate the superior power of knockoffs through simulations. finally, applying the new procedure to data from a case-control study of crohn’s disease in the united kingdom resulted in twice as many discoveries as the original analysis of the same data.