A UTO E NCODING K NOCKOFF GENERATOR FOR FDR C ONTROLLED V ARIABLE S ELECTION
Anonymous authors
Paper under double-blind review
A BSTRACT
A new statistical procedure (Model-X Cand`es et al.
(2018)) has provided a way to identify important factors using any supervised learning method controlling for FDR.
This line of research has shown great potential to expand the horizon of machine learning methods beyond the task of prediction, to serve the broader needs in scientiﬁc researches for interpretable ﬁndings.
However, the lack of a practical and ﬂexible method to generate knockoffs remains the major obstacle for wide application of Model-X procedure.
This paper ﬁlls in the gap by proposing a model-free knockoff generator which approximates the correlation structure between features through latent variable representation.
We demonstrate our proposed method can achieve FDR control and better power than two existing methods in various simulated settings and a real data example for ﬁnding mutations associated with drug resistance in HIV-1 patients
I NTRODUCTION
In the past decades, the machine learning methods have achieved great advancement in improving prediction accuracy.
However, prediction accuracy is not the sole quest of ’big data’ analysis.
A universal aim across a lot of scientiﬁc disciplines is to identify the causes of certain outcome.
For example, in new drug development, a personalized medicine strategy can be formed by identifying the genetic markers that is biologically linked to certain drug response or resistance.
In electronic health record analysis, the goal is to identify ’actionable’ factors for the purpose of reducing cost and improving the quality of care.
In epidemiology or sociology studies, it is of interest to identify protection or risk factors, especially those that can be changed through public policy or civil planning to improve public welfare.
In these scientiﬁc endeavors, the need is to identify the important factors associated with a certain outcome, so that further conﬁrmatory investigation (e.g. randomized international studies) could be conducted to expand knowledge or change future actions for a better outcome.
For this purpose, we are interested in procedures that control the Type I error, which is the chance of a false discovery.
With a large amount of factors to test, controlling the chance of any false discovery (family-wise error) is too stringent.
Therefore the objective is usually relaxed to control the False Discovery Rate (FDR) (Benjamini & Hochberg, 1995).
A recent breakthrough in the statistical theory, i.e. the Model-X framework(Barber & Cand`es, 2015;
Cand`es et al., 2018), provided a general solution.
It can be incorporated with any machine learning models to select true signals associated with the outcome, with rigorous control for FDR.
This line of research sheds light on expanding the horizon of supervised learning methods beyond prediction.
However, the implementation of Model-X requires the generation of the so called ’knockoffs’, which has limited existing methods.
The goal of our paper is to ﬁll in the gap by proposing a model-free method for generating knockoffs with relaxed assumptions for the data, leveraging the power of the recent development in deep generative models.
Speciﬁcally, we propose a framework to generate knockoffs based on latent variable Z which captures the correlation structure of X .
This provides a great generalization from the existing knockoff generation methods for hidden Markov model (HMM) and mixture Gaussian to (but not limited to)
Hidden Markov Random Field.
The contribution of this paper is in two folds: ﬁrst, we tackles the problem of generating Model-X knockoffs for any data set by proposing and justifying a framework based on latent variable Z ; second, the proposed framework is a novel application for variational auto encoder and its variants.
Compared with other deep learning architecture to generate knockoff, the proposed framework has the advantage in less computational complexity and thus easier to be implemented by domain scientists.
B ACKGROUND
The model-X framework (Cand`es et al., 2018) is proposed for the following problem.
There are N i.i.d.
samples ( X ( i ) , Y ( i ) ) from a population, where the predictors are random variables
X =
( X 1 , . . .
, X p ) .
The outcome Y only depends on a subset of predictors S ∈ { 1 , 2 , . .
. , p } , i.e. given { X j , j ∈ S } , Y is independent of { X j , j / ∈ S } . The smallest set S that satisﬁes this requirement is considered as the true predictors.
The goal is to ﬁnd a good estimator ˆ S for S with control of the FDR
=
E (cid:16) # { j : j ∈ ˆ S \ S } # { j : j ∈ ˆ S }∨ 1 (cid:17) .
Barber & Cand`es (2015) ﬁrst proposed the method for linear regression with Gaussian errors, where the design matrix X is assumed to be ﬁxed.
Cand`es et al.
(2018) greatly generalized it to the Model-X framework.
The traditional statistical models focusing on the conditional distribution Y | X 1 , . . .
, X p . In contrast, Model-X makes no assumption for the conditional distribution, but assume X has a known distribution for the purpose of generating knockoffs ˜
X that satisﬁes Deﬁnition 2.1.
Deﬁnition 2.1 Model-X knockoffs for the family of random variables X =
( X 1 , . . .
, X p ) are a new family of random variables ˜
X
=
( ˜ X 1 , . . .
, ˜ X p ) constructed with the following two properties: (1) for any subset S ⊂ { 1 , . . .
, p } , ( X, ˜ X ) swap ( S ) =
d ( X, ˜ X ); (2) ˜
X ⊥⊥ Y | X if there is a response
Y. (2) is guaranteed if ˜ X is constructed without looking at Y.
The following proposition 1 provide an equivalent condition for checking Model-X knockoffs.
Proposition 1 (Cand`es 2018)
The random variables ˜ X
= ( ˜ X 1 , . . .
, ˜ X p ) are Model-X knockoffs for X =
( X 1 , . . .
, X p ) if and only if the joint distributions are equal after swapping X j and ˜ X j , i.e. ( X j , X − j , ˜ X j , ˜ X − j ) =
d ( ˜ X j , X − j , X j , ˜ X − j ) , for any j ∈ { 1 , . . .
, p } , where X − j denote the other variables.
And Y | =
˜ X | X .
Suppose one can generate Model-X knockoffs, the features are selected through the model-speciﬁc feature statistics W j = w j ([ X, ˜ X ] , y ) .
The requirement for the feature statistic is that the distribution for the W j ’s from the null variables ( X j (cid:54)∈ S ) need to be symmetric.
This is formalized as the ﬂip-sign property,
[Equation]
According to Thm 3.4 in Cand ` es et al.
(2018), the following procedure (Knockoff) can estimate the ˆ S controlling for modiﬁed FDR, i.e. E (cid:16) # { j : j ∈ ˆ S \ S } # { j : j ∈ ˆ S } + q − 1 (cid:17) ≤ q .
First, compute the threshold τ = min (cid:8) t > 0 :
# { j : W j ≤− t } # { j : W j ≥ t } ≤ q (cid:9) , then the selected set is (Knockoff): [Equation] = { j :
[Equation]
≥ τ } . A slightly more conservatively procedure (Knockoff+) increase the negative number in numerator by 1 , and is able to control for the usual FDR. The threshold for Knockoff+ is τ + = min (cid:8) t > 0 : 1+# { j : W j ≤− t } # { j : W j ≥ t } ≤ q (cid:9) , and the selected set is
[Equation]
Notice that the Knockoff approach controls for the modiﬁed FDR, which might have more power than Knockoff+, but it does not guarantee the control for the usual FDR. In the experiments of this paper, we used the Knockoff+.
An example of the feature statistics is the signed max lambda statistics in L 1 penalized regressions Barber & Cand`es (2015): for the concatenated design matrix [ X, ˜ X ] , deﬁne ˆ β ( λ ) =
arg min b (cid:110) Loss ( y, [ X ˜ X ] b ) + λ (cid:107) b (cid:107)
L 1 (cid:111) .
Intuitively, the true predictors with strong signals would have entered the LASSO selection with large λ and X j is entering the model with larger λ than its knockoff ˜ X j .
The null variables will enter the model with smaller penalty.
Thus the signed max lambda statistic is deﬁned as W j = ( Z j ∨ ˜ Z j ) sign ( Z j − ˜ Z j ) .
Where Z j = sup { λ : ˆ β 2 j − 1 ( λ ) (cid:54) = 0 } and ˜ Z j = sup { λ : ˆ β 2 j ( λ ) (cid:54) = 0 } .
Various feature statistics has been proposed for common learning methods (Cand`es et al., 2018; Gimenez et al., 2018), however the current knockoff generation methods are still limited to make Model-X generally applicable on any real data set.
X
X(cid:15) X(cid:15)(cid:15)
X n (cid:15) n (cid:15)...
X X
Z(cid:15)
X
Z(cid:15)(cid:15)
X n (cid:15) n
Z m (cid:15)...
[Figure]
Although Cand ` es et al.
(2018) provided a general algorithm for generating Model-X knockoffs, i.e. the Sequential Conditional Independent Pairs algorithm, it needs to sample from the conditional distribution of ˜ X j from f ( X j | X − j , ˜ X 1: j − 1 ) which becomes intractable with slightly complex distributional assumption for X .
Cand ` es et al.
(2018) also proposed a second-order approach by matching ﬁrst two moments of ( X, ˜ X ) swap ( S ) and ( X, ˜ X ) , which satisﬁes Def. 2.1 when X is from Gaussian distribution.
Sesia et al.
(2018) proposed an algorithm to sample knockoffs when X is from Hidden Markov Model.
Gimenez et al.
(2018) proposed algorithm that applicable for X from simple
Bayesian network models (such as mixture Gaussian) with distributional assumptions for certain conditional probabilities which need to be estimated and sampled from.
A M ODEL -F REE K NOCKOFF G ENERATOR W ITH L ATENT E NCODING V ARIABLES . 3. E XISTENCE OF D ESIRED L ATENT V ARIABLE Z
Conceptually, the Model-X focuses on controlling for the FDR of testing the null hypotheses
X j | =
Y |
X − j , where j = 1 , . . . , p , and X − j denote the variables except X j .
Thus, a necessary condition for X j to be chosen by Model-X is that it contains signals not contained in the other variables, i.e. X j can not be a determinant function of X − j .
In the knockoff generating process, any component of X j ’s that is independent from X − j is easy to generate.
The difﬁculty and necessity to consider complex conditional distribution is introduced by the correlated component.
Thus we formed a general framework based on the assumption that there exists some latent variable Z so that
X j ’s are mutually independent conditional on Z .
Such Z always exists for any X , one can take Z = X or Z = f ( X ) , such that f is an one-onone mapping between X and Z .
However, to generate powerful knockoff, the mutual information between ˜ X j and X j is desired to be small. In our framework, to generate ˜ X different from original X , we need X | Z is not degenerated and larger variation in X | Z leads to larger mutual information between X and ˜ X .
Thus our framework relies on that there exists Z such that X | Z is mutually independent and X
| Z is not degenerated, at least for a subset of X with non-zero measure.
In the following we provide motivational examples followed by a lemma to prove such Z exists for general X . A general class of models satisﬁes this assumption is the Hidden Markov Random Field as illustrated by the undirected graphical models in Figure 1.
The latent variables are from a Markov Random
Field and the observed random variables
X j ’s are generated from Z (cid:48)
s with independent errors.
If X ’s are from binomial (for binary data) or multinomial distribution (for categorical data) with positive probability mass, the desired latent variable Z always exists as a categorical variable with probabilities from the tensor decomposition of multi-way contingency array of probability for X
Bhattacharya & Dunson (2012),i.e., p ( x ) =
(cid:80) k π k (cid:81)
j p ( x j | z = k ) . Then X i | Z ’s are generated from Bernoulli or multinomial with parameters as functions of Z and thus the conditional density p ( X i | Z ) ’s are not degenerate.
For continuous or inﬁnite discrete state X , De Finetti’s theorem states that if the distribution ( X 1 , X 2 , . . .
, X n ) is exchangeable then there exists a one dimensional non-degenerate latent variable Z that satisﬁes our requirement.
Thus the desired Z exists for the multivariate normal distribution or trans-elliptical distribution (i.e., any distribution that can be transformed into multivariate normal distribution by element-wise transformation).
The mixture of trans-elliptical distribution also has the desired latent Z as the combination of the single latent variable which indicate the cluster and the latent Z for each cluster.
Even for the non Gibbs Random Field ( X is not from Markov Random Field), the latent Z can exist, for example f ( x 1 , x 2 )
= 2 1 { x 1 + x 2 ≤ 1 , x 1 ≥ 0 and x 2 ≥ 0 } .
Consider the partition of the support { x 1 + x 2 ≤ 1 , x 1 ≥ 0 and x 2 ≥ 0 } into countable many squares.
The desired Z can be deﬁned as the indicator whether X belong to the squares.
X |
Z is then the uniform distribution on that square, X 1 and X 2 are independent given Z .
More generally, for continuous X , we can prove the desired Z exists with the following Lemma 3.1. In the lemma, we considers X from a non-degenerate continuous distribution with density f ( x ) . Lemma 3.1 For any non-negative function f : R p → R whose support contain an interior point, there exist non-negative functions f k : R p
→ R , k = 1 , 2 , · · · , is product function, i.e., f k ( x ) = (cid:81)
j f kj ( x j ) and π k > 0 such that f ( x ) =
(cid:80)
k π k f k ( x ) and at least one V ( f k ) = (cid:82) x 2 f k ( x ) µ ( dx ) − [ (cid:82) xf k ( x ) µ ( dx )] 2 is non-zero.
Proof : Since f ( x ) ’s discontinuous points are at most countable, there exists an interior point of the support x ∗ at which f ( x ) is continuous.
Therefore there exists a cubic area B ( x ∗ , (cid:15) )
= { x : | x j − x ∗ j | ≤ (cid:15), j = 1 , · · · , p } such that for any x ∈ B ( x ∗ , (cid:15) ) , f ( x ) ≥ f ( x ∗ ) / 2 > 0 and π = P ( x ∈ B ( x ∗ , (cid:15) )) > 0 . So we have f ( x ) = f
( x ∗ )(cid:81)
j I ( x j ∈ [ x ∗ j − (cid:15), x ∗ j + (cid:15) ]) + g ( x ) where g ( x ) is a nonnegative function. This can be viewed as a mixture of a uniform distribution on the cubic area with probability f ( x ∗ ) πand a distribution with density
[Equation]
x
[Equation]
with probability 1 − f ( x ∗ ) π. Notice that the uniform component is mutually independent.
The remaining non-negative g ( x ) can be further decomposed into (cid:80) ∞ k
{+=
+}
π k f k , where f k ’s are the sequence of step functions to approximate the g − 1 ( x ) .
So now we have f ( x ) =
f
( x ∗ )(cid:81)
j I ( x j ∈ [ x
[Equation]
j − (cid:15), x
[Equation]
j + (cid:15) ]) + (cid:80) ∞
k =2 π k f k and the ﬁrst term has positive variance, which ﬁnish the proof.
Remark:
The desired Z thus exist for continuous variable, as the latent indicator of which component f k , X is from.
Where X | Z and Z have the following distribution ( X | Z = k ) ∼
[Equation]
( dx ) and P ( Z = k ) = π k (cid:82) f k ( x ) dx . At least for the uniform component, X | Z is not degenerated. To sum up, the desired latent variable Z generally exists for non degenerate continuous and categorical X .
3. M ETHOD AND A LGORITHM
Our proposed procedure has two steps, the ﬁrst step is to generate ˜ Z from the conditional distribution
Z | X and then generate X ’s knockoff from X | Z
=
˜
Z .
Speciﬁcally, consider the non=degenerated random vector of covariates X
=
( X 1 , X 2 , . . .
, X p ) are from p X ( x ) .
As we have shown above, let Z be the vector of latent random variables Z from distribution p Z ( z ) .
Each component of the covariates X j ∼ p (cid:15) ( f i ( Z )) , j = 1 , . .
p , such that (cid:15)
j ’s are mutually independent given Z .
For example, when the predictor is continuous, X j ∼ N ( f j ( Z ) , σ 2 j ) ; and when the predictor is binary, X j ∼ Bernoulli ( f j ( Z )) .
Given the observed samples { x ( i ) } N i =1 from p X ( x ) , to estimate p Z ( z ) and p X | Z may not be an identiﬁable problem.
However, we just need to ﬁnd one Z that approximately satisfy the above condition in practice for our purpose of knockoff generation.
In practice, we assume Z and the conditional distributions are from parametric families and the parameters can be approximated through variational inference.
We denote two working models from parametric families: a) an encoder Q Z | X ( z | x ; θ ) to approximate p Z | X ( z | x ) ; b) a decoder
Q X | Z ( x | z ; f, q (cid:15) ) to approximate p X | Z ( x | z ) .
Where θ denote the parameter for the encoder, and f denote the parameters for decoder.
And q (cid:15) denote the working noise distribution to generate ˜ X given ˆ f ( ˜ Z ) , and (cid:15) is element-wise independent q (cid:15)
= (cid:81)
j q (cid:15) j .
And ˆ θ, ˆ f denote the estimates for these parameters.
Then we propose to generate knockoff ˜ X as Algorithm 1. Q from Q X Z
x
Z f q Notice that the Step 2 in Algorithm 2 is different from the usual VAE implementation.
In the latter, ˜
Z is usually generated from a prior distribution p Z ( z ) , however in our algorithm ˜ Z is generated from the conditional distribution Q Z | X .
The following Theorem 3.2 justiﬁes why our procedure is so.
By ﬁtting a working model from parametric families with X | Z mutually independent, the good reconstruction of X from this model is a surrogate objective for ˜ X is the knockoff of X .
Thus the state of art Variational Auto Encoders (VAE) (Kingma & Welling, 2014; Rezende et al., 2014;
Maddison et al., 2017; Jang et al., 2017) provide a way to estimate the working models in Step 1.
It also worth noting as Gao et al.
(2018) point out that under certain conditions, the ELBO for VAE is equivalent to a lower bound for the Total Correlation Explanation, which is optimized when Z fully decorrelate (disentangle) the X (i.e. conditional of Z, X is mutually independent).
We explain the connection between our notation and the VAE methods in the following two examples.
In the common variational auto encoder, Z ∼ N (0 , I q ) , the working model Q Z i | X is assumed to be from N ( µ i ( X ) , σ 2 i ( X )) , and Q X i | Z is N ( f i ( Z ) , σ 2 ) , where µ i ( • ) and σ 2 i ( • ) and f ( • ) are functions to be approximated by neural networks.
The q (cid:15) in this case is i.i.d.
normal distribution with inﬁnitesimal variance.
So in practice people generate ˜ X as ˆ f ( ˜ Z ) .
Another example is to approximate discrete Z ’s by the concrete distribution Jang et al.
(2017); Maddison et al.
In this case ˜ X is generated from Bernoulli ( ˆ f ( ˜ Z )) and (cid:15) =
˜ X − ˆ f ( ˜ Z ) are element-wise independent.
The objective function of our learning framework is then target on the reconstruction of X , the data’s compatibility with variational model assumptions for Z | X and X | Z .
Alternatively, if one construct knockoff directly from deep neural network with input X and random noise E , ˜ X = f ( X, E ) . The objective is then the discrepancy between ( X, ˜ X ) and ( X, ˜ X ) swap ( S ) .
Since S is any subset of 1,..., p), there are 2 p − 1 ways of swapping. Thus the objective should be a composite function that incorporate all the swapping. This approach may have beneﬁts over our approach when the ’working’ variational auto encoding model is not compatible with the true data distribution. Our proposed framework based on latent variable Z is computational less intensive thus easier to implement.
The pros and cons of our method and various other deep learning based knockoff generator await to be evaluated and compared case by case in various real data sets.
Theorem 3.2 shows that if X is mutually independent conditional on Z , if one is given the true conditional distributions Z | X and X | Z , one can ﬁrst generate ˜ Z from Z | X and then generate ˜ X from X | Z = ˜ Z .
The ˜ X is the model-X knockoff of X .
Theorem 3.3 provides the FDR bound for estimated conditional distribution Z | X and X | Z .
Theorem 3.2 For any vector of random variables Z , such that conditional on Z , X i ’s are mutually independent.
If ˜ Z is from p Z | X ( •| X ) , then ˜ X
from p X | Z ( •| ˜ Z ) is model-X knockoffs.
Proof: For any j ∈ 1 , . .
p and sets A j , B j , A − j , B − j ,
[Equation]
We have shown X j and ˜ X j are exchangeable in the joint distribution, then ˜ X is the Model-X knockoff by Proposition 1.
Now we consider the FDR bound for the knockoffs generated from the estimated encoder and decoder.
We assume the working models and observed distribution of X are approximately compatible as in the conditions of the following theorem.
We then apply the results per Barber et al.
(2018) to show FDR control, where they showed the FDR derived from approximate knockoffs is bounded by a function of the observed KL divergence between ( X j , ˜ X
j , X − j , ˜ X − j ) and ( ˜ X j , X j , X − j , ˜ X
− j ) as below:
[Equation]
Theorem 3.3 Assume the observed marginal distribution p X ( x ) and the working models ( Q Z | X ,
Q X | Z , q (cid:15) estimated in Algorithm 1) are approximately compatible as following: there exists a random vector Z from certain distribution p Z ( z ) and a n → 0 , such that
[Equation]
Where the density of ˆ (cid:15) =
X − ˆ f ( Z ) is denoted as p ˆ (cid:15) , considering ˆ f as a ﬁxed function.
And denote ˆ X
= ˆ f ( Z )
+ (cid:15) as a random variable generated from the decoder Q X | Z ( x | z
=
Z ; ˆ f, q (cid:15) ) .
Then the FDR can be controlled at q exp { 8 na 2 n + 8 (cid:112) n log( p ) a n } .
Proof of Theorem 3.3 is in Appendix A.
Remark: Theorem 3.3. provide FDR bound given the variational models is able to approximate the Z | X and X | Z sufﬁciently close.
However, there is no guarantees for deep generative model to converge with the conditions as in Theorem 3.2. And generally, deep learning knockoff generators gain the ﬂexibility to generate knockoffs from any distribution at the cost of no theoretical guarantee directly from convergence of algorithm to control of FDR. We will discuss this further in section 7.
And we provide two ways for evaluating knockoff generated from our proposed framework in the following section 4.
G OODNESS OF F IT
One evaluation approach proposed by Cand`es et al.
(2018) is to estimate the empirical FDR for simulated Y from the X of the real data, and compare the power and FDR control performance of knockoffs from various generator.
Another method is to compose some goodness of ﬁt metrics based on the distributional discrepancy between ( X, ˜ X ) and ( X, ˜ X ) swap .
We will discuss these metrics further in section 7.
In addition to the metrics shared with other knockoff generator, our framework has a unique measurement of goodness of ﬁt based on the mutual independence condition for X given Z .
Speciﬁcally, if the q (cid:15) is assumed to be additive error,
i.e. ˜ X
j = ˆ f j ( ˜ Z )
+ (cid:15) j .
The residuals X − ˆ f
( ˜ Z ) of the real data X and the ﬁtted means, is mutually independent.
In the following numerical studies, we focus on the ﬁrst evaluation strategy which is based on FDR control for simulated Y .
We include preliminary graphical check for the independence criterion in Appendix C and some further discussion in Section 7 .
S IMULATION
In the simulation, we compare three knockoff generation schemes: a) our proposed method implemented through VAE b) the ﬁxed knockoff generation method in Barber & Cand`es (2015) c) the second order matching in Cand`es et al.
We demonstrate the performance of these methods in two simulation scenarios.
In both scenarios, the sample size is 200 , and number of potential predictors is 100 , where the ﬁrst m variables are the true signals.
The coefﬁcients β for the true predictors are alternating ρ and − ρ , where ρ is the magnitude of the signal.
In Figures 23, the power and FDR are drawn as curves with respect to ρ .
We generated two types of outcomes: the continuous outcomes are generated with errors from standard normal distribution; the binary outcomes are generated from Bernoulli with probabilities 1 / (1 + exp( − Xβ )) .
We use the signed max lambda statistics in Barber & Cand`es (2015) (see definition on page 2).
We implemented the L 1 penalized linear and logistic regression with R package ’glmnet’ correspondingly.
We used the Knockoff+ as in (2) to control for FDR.
Results based on 100 replications are presented for two different numbers of true signals m = 10 , 20 .
Setting 1.
In this setting, we simulate a set of lightly correlated non-normal distributed continuous predictors: a) Generate independent uniform (0 , 1) distributed 200 by 200 random matrix.
b) Let
C be the Cholesky decomposition of the correlation matrix with 0 .
1 on the off diagonal entries and compute Z = UC .
c)
Even column X
i is generated as Z 4 i +0 .
5 ∗ Z
i +1 , and odd column X
i +1 is generated as Z 4 i +2 − 0 .
5 Z 24 i +2 + 0 .
5 exp( Z 4 i +3 ) , where i = 0 , . .
d) Rescale X ’s to be within range [0 , 1] by subtracting the column min and divided by column max − min .
Empirically, the pairwise correlation X ranges from − 0 .
3 to 0 .
6 and the absolute value of the correlation has mean 0.07.
The signal to noise ratios of the Gaussian case approximately has the range of 0 .
25 − 0 .
3 ρfor m = 10 and 0 .
7 − 0 .
85 ρ 2 for setting with m = 20 .
Setting 2.
The second setting generates correlated categorical predictors :a) Generate independent standard Gaussian distributed 200 by 100 random matrix.
b) Let C be the Cholesky decomposition of the correlation matrix with 0 .
1 on the off diagonal entries.
Let Z = UC .
c) X is the categorized
Z matrix, where X ij = 1 ( Z ij > 0) .
Approximately, the signal to noise ratio for the Gaussian case is 2 ρ 2 for m = 10 and 4 ρ 2 for m = 20 .
We present results for FDR controlled at 0 . 1 .
Results According to Figures 2 3, our proposed method implemented through VAE has FDR controlled below the predetermined threshold, and it demonstrates higher power than its two competitors.
Cases with more true signals m = 20 demonstrate better power for Gaussian outcomes, since we control for the proportion of false discoveries, the criterion can tolerate more false discoveries with larger number of true discoveries it detect.
The second-order matching method proposed for the gaussian predictors has very low power due to the violation of its assumption that our generated X are not from Gaussian distribution.
The assumptions for Fixed Knockoff generator is satisﬁed for the linear regression settings(with gaussian errors) but violated for the logistic regression setting.
In the simulation, the FDR is still controlled for cases these assumptions are violated.
However the powers are low.
Implementation details.
For both settings, we implemented our method with VAE Kingma &
Welling (2014).
We defer the training details to Appendix B.
R EAL D ATA E XPERIMENT
In the real data experiment, we demonstrate the performance of our proposed method on generating knockoffs for sparse genetic mutation data.
The dataset and scientiﬁc problem is from a study aiming at detecting mutations associated with drug resistance in patients with Human Immunodeﬁciency Virus Type 1 (HIV-1) Rhee et al.
Due to the space limit, here we present results for the 7 protease inhibitors.
There is no ground truth for which subset of mutations caused the drug resistance.
Nevertheless, there is a set of 73 treatment-selected mutations (TSMs) identiﬁed from a separate study Rhee et al.
(2005), which are selected as the mutations marginally correlated with the patient treatment history with protease inhibitors.
Thus to evaluate the performance of the knockoffs, we ﬁrst simulates the outcome for which we know the true signal, and evaluate the FDR control and power as shown in Figure 4, and then we used the real data outcome and compared our selected mutations with the TSM.
Notice that the TSM is not drug speciﬁc and can not be considered [Figure] as ground truth, by showing number of selected mutations in TSM set we are not showing the FDR control but demonstrate reproducibility across studies.
The normal distributed Z does not ﬁt the discrete and sparse nature of the genetic mutation data.
Thus we adopted the Categorical Variation Auto-Encoder (CAT-VAE)
Jang et al.
(2017); Maddison et al.
where in our implementation, the latent variables Z are 20 Gumbel-Softmax distributed variable with temperature 1, each with 10 categories; both the encoder and decoder has one hidden layer of dimension 200 .
Figure 4 demonstrates the results for simulated outcomes using the real data X .
Overall speaking, our proposed method still achieves the FDR control and demonstrates the highest power among the three.
The correlation is smaller than the previous simulation settings (since the X is a sparse matrix), so the other two methods has better power.
Controlled for a FDR level of 0 . 2 , all three methods achieve a high power of 80% very large signal at ρ = 10 in the Gaussian case.
For the binary case, our proposed method shows greater advantage in achieving more than 2-times the power of the other two methods.
Table 1 presents the number of selected and matched selection of mutations with the 73 TSMs.
Here we present results controlled by both Knockoff+ (as in (2)) and Knockoff (as in (1)) controlled at FDR level 0 .
Similar to the simulated settings, our proposed method select more mutations than the other methods, the average proportion of selected mutation that is in the TSM set for our proposed method is 75.3%, which demonstrate reproducibility across studies.
With less conservative
Knockoff procedure, Fixed and Second-Order methods are able to select more mutations, where our proposed method seems be less sensitive to choice of Knockoff or Knockoff+. [Figure] APV ATV
IDV
LPV
NFV RTV SQV Sample Size
Knockoff+
CAT-VAE 28/ 8/ 34/ 27/ 42/ 38/ 39/
Fixed 25/ 2/
Second-Order    5/ 5/
Knockoff
CAT-VAE 32/ 9/ 34/ 28/ 42/ 38/ 38/
Fixed 30/  14/  26/ 34/ 25/
Second-Order 24/ 4/ 4/ 17/ 29/ 35/ 17/
Implementation details For these analysis, the CAT-VAE knockoffs are generated for 186 mutations with ( ≥ 4 ) occurrence in the data set and the number of patients is 846 .
Since each drug resistance outcome is observed in a subset of samples, when conduct analysis for each drug, we only consider mutations with ≥ 2 occurrence.
Following analysis in Rhee et al.
(2006), the outcome is a continuous variable, which is the log transformed drug susceptibility.
For results in Figure 4, the linear signal is simulated as following: in each replication, randomly chose 50 predictors from 186 mutations , and compute µ as sum of ρx j ’s with alternating signs.
The Gaussian outcome is µ plus a standard normal noise and the binomial outcome is generated from Bernoulli ( 1 1+exp( − µ i ) ) .
[Figure]
C ONCLUSION AND D ISCUSSION
In this paper, we propose a knockoff generating framework based on a latent variable Z to decorrelate X .
We noticed there are two independent works on deep learning generators for knockoff while writing and revising the paper.
(For double blind review consideration, we exclude the citations at this time.)
Compared with the other deep learning frameworks for generating knockoffs, our framework is the only framework directly target on the reconstruction of X from Z .
We provide theoretical results for general existence of such Z .
Our framework offers a computational light solution, and if the data and variational model are compatible, our framework may offers an computationally efﬁcient solution to be easily implemented by domain scientists.
Since deep learning approach targeted on real data from complex distributions, which are not tractable and can not be ﬁtted with simpler models such as gaussian, mixture gaussians, or HMM. The other two works and our work can not provide theoretical FDR guarantee because lack of knowledge regarding convergence of deep learning to the truth.
To solve this problem, one preprint on arXiv (name omitted for double blind review) proposed several goodness of ﬁt statistics to compare deep generative models.
It calls for future research to compare these deep knockoff generators in terms of their power and FDR control performance in simulated Y ’s and also compare them in regards to the goodness of ﬁt metrics.
In addition to these metrics, the structure of our framework provide a unique diagnostic metric, which is based on the conditional independence condition as described in section 4.
We include the graphical check in Appendix C, which demonstrate the estimated Z does attenuate X ’s correlation. in both the simulation settings and the real HIV dataset, For the binary simulated X and HIV data set, the attenuation is closer to independence compared with the continuous simulated X .
It remains for further investigation that if we can adjust the objective function of VAE to improve the goodnessof-ﬁt in terms of independence.
For example, adding a penalization term with the Maximum Mean
Discrepancy metric between distribution of X − f ( ˜ Z ) and the element wise independent distribution from the product of marginal distributions.
To sum up, this paper propose a framework of deep knockoff generator based on latent variables.
This framework offers a computationally light solution to generate knockoffs.
The promising numerical results demonstrated in this paper and the easiness of implementation makes it a promising tool among the choice of deep generating models for FDR controlled variables selection.
A. P ROOF OF T HEOREM 3.
Proof: Consider ˜ˆ X which is another independent sample from Q X | Z ( x | z
= Z ; q (cid:15) )
when sampling ˆ X using the same Z .
Since q (cid:15) is element-wise independent, conditions in Theorem 2.1 holds thus
˜ˆ X is a model-X knockoff of ˆ X and
[Equation]
Notice that by our assumptions
[Equation]
| ≤ a n
[Equation]
| ≤ 2 a n and we can bound the log likelihood ratio by
[Equation]
So we can bound
[Equation]
And FDR has the bound in the statement by applying Lemma 2 in Barber et al.
Speciﬁcally, if a n = o (( n log( p ))
− 1 / 2 ) , then FDR will be asymptotically bounded by q + o (1) .
B. I MPLEMENTATION D ETAILS FOR N EURAL N ETWORKS IN S IMULATION
The latent variables are multivariate normal with 300 dimensions.
The models were trained with batch size 25 and for 20 epochs with the default ‘adam’ optimizer in ‘keras’Chollet et al. (2015).
The architecture of VAE for setting 1 is as following, the encoder networks for µ z and log( σ ) have two hidden layers with 500 and 400 neurons with ‘tanh’ activation and L 2 regularization with tuning parameter 0 .
The activation for the output layer is ‘linear’.
The decoder network has two hidden layers with the same speciﬁcations, followed by a batch-normalization layer and output with linear activation.
The architecture of VAE for setting 2 is as following, the encoder networks has two hidden layers with 500 and 400 neurons with ‘relu’ activation and L 2 regularization with tuning parameter 0 .
The activation for the output layer is ‘linear’.
The decoder is an one layer network with the ‘sigmoid’ activation function and then threshold by 0 . 5 .
C. I LLUSTRATION FOR D ISENTANGLEMENT OF Z .
Here we present the Q-Q plots for the p-values for pairwise correlation test for X and X | Z .
Where the correlation of X | Z is estimated as the pairwise correlation of X − ˆ f
( ˜ Z ) .
When X | Z are mutually independent, the p-values would be from the uniform distribution and the Q-Q plot will coincide with the diagonal line y
= x .
For the simulated settings, it is the result from one replication.
We see for the HIV real data example in Figure A1 (e) (f), the correlation is greatly attenuated by conditioning on Z .
For the simulation studies, the Q-Q plot in setting 2 (Figure A1 (c) and (d)) almost coincide with the diagonal line after conditioning on Z , which indicates good ﬁt of the model.
Interestingly the above two settings, X ’s are binary.
In simulation setting 1 (Figure A1 (a) and (b)), when X ’s are continuous, the disentanglement effect is still visible but not as strong as setting 2 and the HIV example.
[Figure]