Title: LEARNING DISENTANGLED REPRESENTATIONS FOR COUNTERFACTUAL REGRESSION

Abstract: We consider the challenge of estimating treatment effects from observational data; and point out that, in general, only some factors based on the observed covariates X contribute to selection of the treatment T , and only some to determining the outcomes Y . We model this by considering three underlying sources of { X, T, Y } and show that explicitly modeling these sources offers great insight to guide designing models that better handle selection bias in observational datasets. This paper is an attempt to conceptualize this line of thought and provide a path to explore it further.
In this work, we propose an algorithm to (1) identify disentangled representations of the above-mentioned underlying factors from any given observational dataset D and (2) leverage this knowledge to reduce, as well as account for, the negative impact of selection bias on estimating the treatment effects from D. Our empirical results show that the proposed method achieves state-of-the-art performance in both individual and population based evaluation measures.

1. INTRODUCTION:

As we rely more and more on artificial intelligence (AI) to automate the decision making processes, accurately estimating the causal effects of taking different actions gains an essential role. A prominent example is precision medicine -i.e., the customization of health-care tailored to each individual patient -which attempts to identify which medical procedure t ∈ T will benefit a certain patient x the most, in terms of the treatment outcome y ∈ R. Learning such models requires answering counterfactual questions (Rubin, 1974; Pearl, 2009) such as: "Would this patient have lived longer [and by how much], had she received an alternative treatment?".

For notation: a dataset D = { [x i , t i , y i ] } N i=1 used for treatment effect estimation has the following format: for the i th instance (e.g., patient), we have some context information x i ∈ X ⊆ R K (e.g., age, BMI, blood work, etc.), the administered treatment t i chosen from a set of treatment options T (e.g., {0: medication, 1: surgery}), and the respective observed outcome y i ∈ Y (e.g., survival time; Y ⊆ R + ) as a result of receiving treatment t i . Note that D only contains the outcome of the administered treatment (aka observed outcome: y i ), but not the outcome(s) of the alternative treatment(s) (aka counterfactual outcome(s): y t i for t ∈ T \ {t i }), which are inherently unobservable. For the binary-treatment case, we denote the alternative treatment as ¬t i = 1 -t i . Pearl (2009) demonstrates that, in general, causal relationships can only be learned by experimentation (on-line exploration), or running a Randomized Controlled Trial (RCT), where the treatment assignment does not depend on the individual X -see Figure 1 (a). In many cases, however, this is expensive, unethical, or even infeasible. Here, we are forced to approximate treatment effects from off-line datasets collected through Observational Studies. In such datasets, the administered treatment T depends on some or all attributes of individual X -see Figure 1 (b). Here, as Pr( T | X ) = Pr( T ), we say these datasets exhibit selection bias (Imbens & Rubin, 2015) . Figure 2 illustrates selection bias in an example (synthetic) observational dataset. Here, we want to accurately estimate the Individual Treatment Effect (ITE) for each instance ii.e., to estimate e i = y1 i -y 0 i . We frame the solution as learning the function f : X × T → Y that can accurately predict the outcomes (both observed ŷi ti as well as counterfactuals ŷi ¬ti ) given the context information x i for each individual. As mentioned earlier, there are two challenges associated with estimating treatment effects:

(i) The fact that counterfactual outcomes are unobservable (i.e., not present in any training data) makes estimating treatment effects more difficult than the generalization problem in the supervised learning paradigm. This is an inherent characteristic of this task. (ii) Selection bias in observational datasets implies having fewer instances within each treatment arm at specific regions of the domain. This sparsity, in turn, would decrease the accuracy and confidence of predicting counterfactuals at those regions. Here, to treat heart disease, a doctor typically prescribes surgery (t = 1) to younger patients (•) and medication (t = 0) to older ones (+). Note that instances with larger (resp., smaller)

x values have a higher chance to be assigned to the t = 0 (resp., 1) treatment arm; hence we have selection bias. The counterfactual outcomes (only used for evaluation purpose) are illustrated by small • (+) for ¬t =1 (0).

This paper addresses the second challenge by investigating the root causes of selection bias, by dissecting and identifying the underlying factors that can generate an observational dataset D, and leveraging this knowledge to reduce, as well as account for, the negative impact of selection bias on estimating the treatment effects from D. In this work, we borrow ideas from the representation learning literature (Bengio et al., 2013) in order to reduce selection bias and from the domain adaptation literature (Shimodaira, 2000) in order to account for the remainder selection bias that (might) still exist after its reduction.

Our analysis relies on the following assumptions: Assumption 1: Unconfoundedness (Rosenbaum & Rubin, 1983) -There are no unobserved confounders (i.e., covariates that contribute to both treatment selection procedure as well as determination of outcomes). Formally,

{Y t } t∈T ⊥ ⊥ T | X.

Assumption 2: Overlap (Imbens, 2004 ) -Every individual x should have a non-zero chance of being assigned to any treatment arm. That is, Pr( T = t | X = x ) = 0 ∀t ∈ T , ∀x ∈ X . These two assumptions together are called strong ignorability (Rosenbaum & Rubin, 1983) . Imbens & Wooldridge (2009) showed that strong ignorability is sufficient for ITE to be identifiable.

Without loss of generality, we assume that the random variable X follows a(n unknown) joint probability distribution Pr( X | Γ, ∆, Υ ), treatment T follows Pr( T | Γ, ∆ ), and outcome Y 

Main contribution::

We argue that explicit identification of the underlying factors { Γ, ∆, Υ } in observational datasets offers great insight to guide designing models that better handle selection bias and consequently achieve better performance in terms of estimating ITEs. In this paper, we propose a model, named Disentangled Representations for CounterFactual Regression (DR-CFR), that is optimized to do exactly that. We also present experiments that demonstrate the advantages of this perspective; and show empirically that the proposed method outperforms state-of-the-art models in a variety of data generation scenarios with different dimensionality of factors; see below.

2. RELATED WORKS:

Selection bias in observational datasets is equivalent to a domain adaptation scenario where a model is trained on a "source" (observed) data distribution, but should perform well on a "target" (counterfactual) one. Learning treatment effects from observational datasets is closely related to "off-policy learning from logged bandit feedback" -cf., (Swaminathan & Joachims, 2015a) , whose goal is learning an optimal policy that selects the best personalized treatment for each individual. A common statistical solution is re-weighting certain data instances to balance the source and target distributions. The majority of re-weighting approaches belong to the Inverse Propensity Weighting (IPW) family of methods -cf., (Austin, 2011; Bottou et al., 2013; Swaminathan & Joachims, 2015c) . While IPW methods are unbiased, they suffer from high variance. Swaminathan & Joachims (2015b) proposed the Counterfactual Risk Minimization (CRM) principle to alleviate this issue. In summary, re-weighting is an attempt to account for the selection bias. Johansson et al. (2016) is among the pioneer works that explored ways to use techniques from representation learning (Bengio et al., 2013) to reduce the selection bias. Shalit et al. (2017) present a refined version of (Johansson et al., 2016) 's method that learns a common representation space Φ(x) = φ by minimizing the discrepancy (Mansour et al., 2009) (hereinafter "disc") between the conditional distributions of φ given t = 0 versus φ, given t = 1. That is,

EQUATION

which is (effectively) a regularization term that attempts to reduce selection bias in the learned representation. On top of this representation learning network, they trained two regression networks h t (φ) -one for each treatment arm (t ∈ {0, 1}) -that predict the outcomes.

Hassanpour & Greiner (2019) argued that the learned representation cannot and should not remove all the selection bias, as the confounders not only contribute to choosing a treatment but also to determining the respective outcomes.2 As a result, where there are confounders (which is a common situation), even φ would exhibit some selection bias, although less than that in the original domain x.

They built on the work of (Shalit et al., 2017) by introducing context-aware importance sampling weights, that attempt to account for the above-mentioned remainder selection bias. These weights

ω i = 1 + Pr( φ i | ¬t i ) Pr( φ i | t i ) = 1 + Pr( t i ) 1 -Pr( t i ) • 1 -π t i | φ i π t i | φ i (2)

are designed to enhance performance of estimating both factual as well as counterfacual outcomes (by the 1 and Pr( φ | ¬t ) Pr( φ | t ) terms, respectively), where π t i | φ i is the probability of assigning the observed t i conditioned on the learned context φ i .

Note that both (Shalit et al., 2017) and (Hassanpour & Greiner, 2019 ) use Φ to model the concatenation of factors ∆ and Υ (see Figure 3 ). Although it does make sense that there should be no discrepancy between conditional distributions of Υ, the ∆ factor should model the confounding factors, which by definition, must embed some information about treatment assignment. This would result in a positive discrepancy between conditional distributions of ∆ that should not be minimized. Thus, minimizing Equation ( 1) with respect to Φ can lead to problematic results as it discards some of the confounders. Yao et al. (2018) proposed the Similarity preserved Individual Treatment Effect (SITE) method, which extends Shalit et al. ( 2017)'s framework by adding a local similarity preserving component. This component acts as a regularization term, that attempts to retain the same neighbourhood relationships in the learned representation space as exhibited in the original space, by matching the propensity scores Pr( t = 1 | x ) and Pr( t = 1 | φ ). This, however, results in learning sub-optimal representations when Γ = ∅ as SITE tries to keep instances whose Γs are far apart, also far apart in φ. In other words, this component penalizes reducing selection bias in φ by not discarding the irrelevant information present in Γ even when it does not hurt the outcome estimation at all.

Our work has many similarities to (Kuang et al., 2017) , who decomposed X into two subsets: confounding and adjustment variables, which are similar to our ∆ and Υ factors respectively. They then used an optimization algorithm for identifying these variables, to ultimately find an unbiased estimate of the Average Treatment Effect (ATE). We extend their work in three ways: (i) In addition to confounders and adjustment variables, we also identify the factors that determine the treatment and have no effect on the outcome (i.e., Γ). (ii) Unlike (Kuang et al., 2017) that take a linear approach by tagging the raw features as either confounders or adjustment variables, our proposed method has the capacity to learn [non-linear] representations of the underlying factors. (iii) Our method facilitates estimating both ATE as well ITE, whereas (Kuang et al., 2017) cannot provide estimates of ITEs.

3. LEARNING DISENTANGLED REPRESENTATIONS:

We assume, without loss of generality, that any dataset of the form { X, T, Y } is generated from three underlying factors { Γ, ∆, Υ }, as illustrated in Figure 3 . 3 Observe that the factor Γ (resp., Υ) partially determines only T (resp., Y ), but not the other variables; and ∆ includes the confounding factors between T and Y . This graphical model suggests that selection bias is induced by factors Γ and ∆. It also shows that the outcome depends on the factors ∆ and Υ. Inspired by this graphical model, our model architecture incorporates the following components:

• Three representation learning networks; one for each underlying factor: Γ(x), ∆(x), and Υ(x).

• Two regression networks; one for each treatment arm: h 0 ( ∆(x), Υ(x) ) and h 1 ( ∆(x), Υ(x) ).

• Two logistic networks: π 0 t | Γ(x), ∆(x) to model the logging policy -aka behaviour policy in Reinforcement Learning; cf., (Sutton & Barto, 1998) -and π t | ∆(x) to design weights that account for the confounders' impact.

We therefore try to minimize the following objective function:

EQUATION

where ω t i , ∆(x i ) is the re-weighting function; L y i , h ti ∆(x i ), Υ(x i ) is the prediction loss for observed outcomes (aka factual loss); disc {Υ(x)} i:ti=0 , {Υ(x)} i:ti=1 calculates the discrepancy between conditional distributions of Υ given t = 0 versus given t = 1; -log π 0 ( • ) is the cross entropy loss of predicting the assigned treatments given the learned context; and Reg( • ) is the regularization term for penalizing model complexity. The following sections elaborate on each of these terms.

3.1 FACTUAL LOSS: L y, h t ∆(x), Υ(x)

Similar to (Johansson et al., 2016; Shalit et al., 2017; Hassanpour & Greiner, 2019; Yao et al., 2018) , we train two regression networks h 0 and h 1 , one for each treatment arm. As guided by the graphical model in Figure 3 , the inputs to these regression networks are the outputs of the ∆(x) and Υ(x) representation networks and their outputs are the predicted outcomes for their respective treatments.

Note that the prediction loss L can only be calculated on the observed outcomes (hence the name factual loss), as counterfactual outcomes are not available in any training set. This would be an L2-loss for real-valued outcomes and a log-loss for binary outcomes. By minimizing the factual loss, we ensure that the union of the learned representations ∆(x) and Υ(x) retain enough information needed for accurate estimation of the observed outcomes.

3.2. RE-WEIGHTING FUNCTION: ω t, ∆(x):

We follow (Hassanpour & Greiner, 2019) 's design for weights as re-stated in Equation ( 2), with the modification that we employ ∆ to calculate the weights instead of Φ. Although following the same design, we anticipate our weights should perform better in practice than those in (Hassanpour & Greiner, 2019) as: (i) no confounders are discarded due to minimizing the imbalance loss (because our disc is defined based on Υ, not Φ); and (ii) only the legitimate confounders are used to derive the weights (i.e., ∆), not the ones that have not contributed to treatment selection (i.e., Υ).

Notably, the weights design in Equation ( 2) is different from the common practice in re-weighting techniques (e.g., IPW) in that the weights are calculated based on all factors that determine T (i.e., Γ as well as ∆). However, we argue that incorporation of Γ in the weights might result in emphasizing the wrong instances. In other words, since the factual loss L is only sensitive to factors ∆ and Υ, and not Γ, re-weighting L according to Γ would yield a wrong objective function to be optimized.

3.3. IMBALANCE LOSS:

: disc {Υ(x i )} i:ti=0 , {Υ(x i )} i:ti=1

According to Figure 3 , Υ should be independent of T due to the collider structure at Y . Therefore,

EQUATION

We used Maximum Mean Discrepancy (MMD) (Gretton et al., 2012) to calculate dissimilarity between the two conditional distributions of Υ given t = 0 versus t = 1.

By minimizing the imbalance loss, we ensure that the learned factor Υ embeds no information about T and all the confounding factors are retained in ∆. Capturing all the confounders in ∆ and only in ∆ is the hallmark of the proposed method, as we will use it for optimal re-weighting of the factual loss term (next section). Note that this differs from Shalit et al. (2017) 's approach in that they do not distinguish between the independent factors ∆ and Υ; and minimizing the loss defined on only one factor Φ which might erroneously suggest discarding some of the confounders in ∆.

3.4. CROSS ENTROPY LOSS:

: -log π 0 t | Γ(x), ∆(x)

We model the logging policy as a logistic regression network parameterized by [ W 0 , b 0 ] as follows:

π 0 ( t | ψ ) = 1 + e -( 2t-1 )( ψ•W0+b0 ) -1

, where ψ is the concatenation of matrices Γ and ∆.

Minimizing the cross entropy loss enforces learning Γ and ∆ in a way that allows π 0 ( • ) to predict the assigned treatments. In other words, the union of the learned representations of Γ and ∆ retain enough information to recover the logging policy that guided the treatment assignments.

4. EXPERIMENTS:



4.1. BENCHMARKS:

Evaluating treatment effect estimation methods is problematic on real-world datasets since, as mentioned earlier, their counterfactual outcomes are inherently unobservable. A common solution is to synthesize datasets where the outcomes of all possible treatments are available, then discard some outcomes to create a proper observational dataset with characteristics (such as selection bias) similar to a real-world one -cf., (Beygelzimer & Langford, 2009; Hassanpour & Greiner, 2018) . In this work, we use two such benchmarks: our synthetic series of datasets as well as a publicly available benchmark: the Infant Health and Development Program (IHDP) (Hill, 2011).

4.1.1. SYNTHETIC DATASETS:

We generated our synthetic datasets according to the following process, which takes as input the sample size 3) ; for each factor L ∈ { Γ, ∆, Υ }, the means and covariance matrices (µ L , Σ L ); and a scalar ζ that determines the slope of the logistic curve.

N ; dimensionalities [m Γ , m ∆ , m Υ ] ∈ Z +(

• For each latent factor -Sample m Γ +m ∆ tuple of coefficients θ from N (0, 1) mΓ+m∆ -Define the logging policy as

EQUATION

π 0 ( t = 1 | z ) = 1 1+exp(-ζz)

, where z = Ψ • θ -For each instance x i , sample treatment t i from the Bernoulli distribution with parameter

π 0 ( t = 1 | z i ) • For outcomes Y 0 and Y 1 : -Sample m ∆ +m Υ tuple of coefficients ϑ 0 and ϑ 1 from N (0, 1) m∆+mΥ -Define y 0 = (Φ • Φ • Φ + 0.5) • ϑ 0 /(m ∆ +m Υ ) + ε and y 1 = (Φ • Φ) • ϑ 1 /(m ∆ +m Υ ) + ε,

where ε is a white noise sampled from N (0, 0.1) and • is the symbol for element-wise (Hadamard/Schur) product.

We considered all the viable datasets in a mesh generated by m Γ , m ∆ , m Υ ∈ {0, 4, 8}. This creates 24 scenarios4 that consider all possible situations in terms of the relative sizes of the factors Γ, ∆, and Υ. For each scenario, we synthesized five datasets with various initial random seeds.

4.1.2. INFANT HEALTH AND DEVELOPMENT PROGRAM (IHDP):

The original RCT data was designed to evaluate the effect of specialist home visits on future cognitive test scores of premature infants. Hill (2011) induced selection bias by removing a non-random subset of the treated population to create a realistic observational dataset. The resulting dataset contains 747 instances (608 control, 139 treated) with 25 covariates. We run our experiments on the same benchmark (100 realizations of outcomes) provided by and used in (Johansson et al., 2016; Shalit (a) Slice of the weights matrix that connects {the variables in X belonging to Γ} to {the first layer of the representation network that attempts to identify Γ}.

The size of this slice is mΓ ×K.

(b) Slice of the weights matrix that connects {the variables in X not belonging to Γ} to {the first layer of the representation network that attempts to identify Γ}. The size of this slice is (m∆ +mΥ)×K. First, we want to determine if the proposed method is able to identify the variables that belong to each underlying factor. To do so, we look at the weight matrix in the first layer of each representation network, which is of size (m Γ +m ∆ +m Υ )×K, where K is the number of neurons in the first hidden layer of the respective representation network. For example, to check if Γ is identified properly, we partition the weights matrix into two slices, as shown in Figure 4 , and calculate the average of each slice. The first slice [referred to as S Γ ; highlighted in Figure 4 (a)] pertains to " Γ's ground truth variables in X " and the second slice [S ¬Γ ; Figure 4 (b)] pertains to "variables in X that do not belong to Γ". Constructing S ∆ , S ¬∆ , S Υ , and S ¬Υ follow a similar procedure.

If the proposed method achieves a good identification, then we expect the average of the absolute values of weights in S Γ should be higher than that of S ¬Γ ; this same claim should hold for (S ∆ , S ¬∆ ) and (S Υ , S ¬Υ ) as well. Note that only the relative relationships between the average weights in either of the slices matter; since this analysis is aimed at checking whether, for example, for identifying Γ, its respective representation network has indeed learned to emphasize on "Γ's ground truth variables in X " more than the other variables in X. Figure 5 illustrates the identification performance of DR-CFR according to this analysis; showing empirically that the proposed method successfully identifies all the three underlying factors, for all synthetic datasets.

4.2.2. EVALUATING ESTIMATION OF TREATMENT EFFECTS:

Given a synthetic dataset (that include both factual as well as counterfactual outcomes), one can evaluate treatment effect estimation methods with two types of performance measures:

• Individual-based: "Precision in Estimation of Heterogeneous Effect" PEHE = 1

N N i=1 (ê i -e i ) 2

where êi = ŷ1 i -ŷ0 i is the predicted effect and e i = y 1 i -y 0 i is the true effect. • Population-based: "Bias of the Average Treatment Effect" ATE = ATE -ATE where ATE = 1 N N i=1 y 1 i -1 N N j=1 y 0 j in which y 1 i and y 0 j are the true outcomes for the respective treatments and ATE is calculated based on the estimated outcomes.

In this paper, we compare performances of the following treatment effect estimation methods:5 

• CFR: CounterFactual Regression (Shalit et al., 2017) .

• CFR-ISW: CFR with Importance Sampling Weights (Hassanpour & Greiner, 2019) .

• SITE: Similarity preserved Individual Treatment Effect (Yao et al., 2018) .

• DR-CFR: Disentangled Representations for CFR -our proposed method.

Figure 6 visualizes the PEHE measures in radar charts for these four methods, trained with datasets of size N = 2,500 (left) and N = 10,000 (right). As expected, all methods perform better with observing more training data; however, DR-CFR took the most advantage by reducing PEHE the most (by 0.15, going down from 0.60 to 0.45), while CFR, CFR-ISW, and SITE reduced PEHE by 0.07, 0.08, and 0.08 respectively.

Table 1 summarizes the PEHE and ATE measures (lower is better) for all scenarios, in terms of mean and standard deviation of all the 24×5 datasets, in order to give a unified view on the performance. DR-CFR achieves the best performance among the contending methods. These results are statistically significant based on the Welch's unpaired t-test with α = 0.05. Table 2 summarizes the PEHE and ATE measures on the IHDP benchmark. The results are reported in terms of mean and standard deviation over the 100 datasets with various realizations of outcomes. Again, DR-CFR achieves the best performance (statistically significant for ATE ) among the contending methods.

5. FUTURE WORKS AND CONCLUSION:

The majority of methods proposed to estimate treatment effects -including this work -fall under the category of discriminative approaches. A promising direction is to consider developing generative models, in an attempt to shed light on the true underlying data generating mechanism. Perhaps this could also facilitate generating new, virtual, yet realistic data instances -similar to what is done in computer vision. Louizos et al. (2017) 's method is a notable generative approach, which uses Variational Auto-Encoder (VAE) to extract latent confounders from their observed proxies. While that work is an interesting step in that direction, it is not yet capable of addressing the problem of selection bias. We believe that our proposed perspective on the problem can be helpful to solve this open question. This is left to future work.

In this paper, we studied the problem of estimating treatment effect from observational studies. We argued that not all factors in the observed covariates X might contribute to the procedure of selecting treatment T , or more importantly, determining the outcomes Y . We modeled this using three underlying sources of X, T , and Y , and showed that explicit identification of these sources offers great insight to help us design models that better handle selection bias in observational datasets.

We proposed an algorithm, Disentangled Representations for CounterFactual Regression (DR-CFR), that can (1) identify disentangled representations of the above-mentioned underlying sources and

(2) leverage this knowledge to reduce as well as account for the negative impact of selection bias on estimating the treatment effects from observational data. Our empirical results showed that the proposed method achieves state-of-the-art performance in both individual and population based evaluation measures.

:

Examples for: (Γ) rich patients receiving the expensive treatment while poor patients receiving the cheap one -although outcomes of the possible treatments are not particularly dependent on patients' wealth status; (∆) younger patients receiving surgery while older patients receiving medication; and (Υ) genetic information that determines the efficacy of a medication, however, such relationship is unknown to the attending physician.

While Hassanpour & Greiner (2019) presented a graphical model similar to our Figure

3, they only used it to investigate the nature of selection bias. N.b., they did not implement the idea of learning disentangled representations for counterfactual regression; instead, their method [like(Shalit et al., 2017)] learns a common representation φ that can represent only the confounders, but not the other factors. Our approach extends theirs by providing an algorithm that can learn disentangled representations of the underlying factors from observational datasets.

Note that the assumption of unconfoundedness still holds; here is why: Short: Observing either X or ∆ blocks the path from T to Y, which supports the unconfoundedness assumption. Long: Once the representation networks are learned from the observational data, we can compute the latent factors { Γ, ∆, Υ } from X only. Therefore, although these factors are not explicitly observed, they are effectively observed, in that they are derived directly from the observed X, and so should not be categorized as "unobserved confounders". For example, the latent factor for "zip code" in X is "socio-economic status" (perhaps in ∆). In other words, "socio-economic status" can be inferred from "zip code" which can be viewed as a proxy for it.

There are not 2 3 = 27 scenarios because we removed the three tuples: (0, 0, 0), (4, 0, 0), and (8, 0, 0), as any scenario with ∆ = Υ = ∅ would generate outcomes that are pure noise.

Note that all four methods share the same core code-base: based on CFR (developed byJohansson et al. (2016) andShalit et al. (2017)) and so they share very similar model architectures. To allow for fair comparison, we searched their respective hyperparameter spaces, constrained to ensure that all had the same model complexity.

Figures and Tables:

Figure 1: Belief net structure for randomized controlled trials and observational studies. Here, Y 0 (Y 1 ) is the outcome of applying T = treatment#0 (#1) to the individual represented by X.

Figure 2: An example observational dataset.Here, to treat heart disease, a doctor typically prescribes surgery (t = 1) to younger patients (•) and medication (t = 0) to older ones (+). Note that instances with larger (resp., smaller)x values have a higher chance to be assigned to the t = 0 (resp., 1) treatment arm; hence we have selection bias. The counterfactual outcomes (only used for evaluation purpose) are illustrated by small • (+) for ¬t =1 (0).

follows Pr T ( Y T | ∆, Υ ), where Γ, ∆, and Υ represent the three underlying factors 1 that generate an obser-vational dataset D. The respective graphical model is illustrated in Figure 3. Conforming with the statements above, note that the graphical model also suggests that selection bias is induced by factors Γ and ∆, where ∆ represents the confounding factors between T and Y .

Figure 3: Underlying factors of X; Γ (Υ) are factors that partially determine only T (Y ) but not the other random variable; and ∆ are confounders; Selection bias is induced by factors Γ and ∆.

Γ, ∆, and Υ to make the covariates matrixX [of size N ×(m Γ +m ∆ +m Υ )] -Concatenate Γ and ∆ to make Ψ [of size N ×(m Γ +m ∆ )] -Concatenate ∆ and Υ to make Φ [of size N ×(m ∆ +m Υ )]• For treatment T :

Figure 4: Visualization of slicing the learned weights matrix in the first layer of the representation network (number of neurons: K) for identifying Γ (best viewed in color).

Figure 5: Radar charts that visualize the capability of DR-CFR in identifying the underlying factors Γ, ∆, and Υ. Each vertex on the polygons is identified with the factors' dimension sequence (m Γ _m ∆ _m Υ ) of the associated synthetic dataset. The polygons' radii are scaled between 0 : 0.09 and quantify the average weights of the first slice (in dotted magenta) and the second slice (in cyan).

Figure 6: Radar charts for visualizing the PEHE performance results on the synthetic datasets. Training sample size on the left chart is 2,500 and on the right chart is 10,000. Each vertex on the polygons is identified with the factors' dimension sequence (m Γ _m ∆ _m Υ ) of the associated group of datasets.The polygons' radii are scaled between 0 : 0.8 to quantify the PEHE values (i.e., the closer to the centre, the smaller the PEHE). The dashed purple curve illustrates the results of the proposed method.

Synthetic datasets (24×5 with N = 10,000)

Table content: <table><tr><td>Methods</td><td>PEHE</td><td>ATE ATE ATE</td></tr><tr><td>CFR</td><td colspan="2">0.61 (0.05) 0.021 (0.018)</td></tr><tr><td colspan="3">CFR-ISW 0.58 (0.06) 0.017 (0.009)</td></tr><tr><td>SITE</td><td colspan="2">0.63 (0.05) 0.035 (0.039)</td></tr><tr><td>DR-CFR</td><td colspan="2">0.45 (0.11) 0.45 (0.11) 0.45 (0.11) 0.013 (0.006) 0.013 (0.006) 0.013 (0.006)</td></tr></table>

IHDP datasets

Table content: <table><tr><td/><td>(100 with N = 747)</td><td/></tr><tr><td>Methods</td><td>PEHE</td><td>ATE ATE ATE</td></tr><tr><td>CFR</td><td colspan="2">0.81 (0.30) 0.13 (0.12)</td></tr><tr><td colspan="3">CFR-ISW 0.73 (0.28) 0.11 (0.10)</td></tr><tr><td>SITE</td><td colspan="2">0.73 (0.33) 0.10 (0.09)</td></tr><tr><td>DR-CFR</td><td colspan="2">0.65 (0.37) 0.65 (0.37) 0.65 (0.37) 0.03 (0.04) 0.03 (0.04) 0.03 (0.04)</td></tr></table>

Peer review (iclr2020):
The paper proposes an algorithm that identifies disentangled representation to find out an individual treatment effect. A very specific model that tries to find out the underlying dynamics of such a problem is proposed and is learned by minimizing a suggested objective that takes the strengths of previous approaches. The method is demonstrated in a synthetic dataset and IHDP dataset and shown to outperform other previous methods by a large margin. My initial review was negative, but I changed my mind after reading a few papers in this area. It seems that explicit learning of underlying factors that are described in (Hassanpour & Greiner, 2019) is a nice idea and works well. My only concern is that the paper has a lot of overlap with (Hassanpour & Greiner, 2019), even using identical figures. I am not sure whether it is OK.