Pearl 2014 - Selection Diagrams and Definition of Transportability
Summary
A selection diagram augments the common causal diagram of two populations with square -nodes pointing at exactly those mechanisms (functions or exogenous distributions) that may differ between them. Transportability of a causal relation means is uniquely computable from the source experiments, source observations and target observations in every model inducing the diagram. Theorem 1 reduces it to a do-calculus derivation in which appears only as a conditioning variable in -free terms.
Overview
Section 3 showed transportability is a causal notion; Section 4 builds the representation. The key design decision: encode population differences as local modifications of mechanisms, represented by selection variables, so that switching between populations is conditioning on different values of .
Main Content
4.1 Selection variables
Let be the distribution of in the experimental study on (with randomized). Let be the distribution of if the study were conducted on . The difference is attributed to a set of selection variables:
(footnote 16: alternatively write and ; only the location of matters). represents all factors by which populations may differ or that “threaten” transport. Each corresponds to a mechanism that differs. In Fig. 4(a), where stands for all factors responsible for drawing subjects of age to NYC rather than LA. Equally important is the absence of an pointing to in Fig. 4(a): the age-specific effects are invariant.
Footnote 15: disparities can also come from design differences (two samples drawn by different criteria from one population), usually called sampling selection bias (Heckman 1979; Hernan et al. 2004; Cole and Stuart 2010; Pearl 2013; Bareinboim, Tian and Pearl 2014). This paper treats only nature-induced, not man-made, disparities. (Man-made selection bias is treated in the 2016 paper: Bareinboim 2016 - Sample Selection Bias and Recoverability.)
Definition 4 (Selection diagram)
Let be a pair of structural causal models (Definition 1) relative to domains , sharing a causal diagram . is said to induce a selection diagram if is constructed as follows:
- every edge in is also an edge in ;
- contains an extra edge whenever there might exist a discrepancy or between and .
Reading a selection diagram.
- An arrow : the mechanism assigning may differ. It is a statement of possible difference, not a commitment to a specific one.
- Absence of an arrow into : the mechanism is the same in both populations (a strong, testable-in-principle invariance assumption).
- Extreme case: -nodes on every variable = no shared mechanism = no information can be exchanged. The invariance assumptions are what “open the door” for transporting some findings.
- -variables drawn as squares; latent common causes as dashed bidirected arcs.
- Footnote 18: the assumption of no structural changes between domains can be relaxed by starting with and adding -nodes by the same procedure while enforcing acyclicity. Differences in causal directionality (acyclicity fails) or a strict edge-superset of need a more elaborate representation (beyond the paper).
- Footnote 17: Pearl (1993, 2009b), Spirtes et al. (1993), Dawid (2002) use conditioning on auxiliary variables to switch between experimental and observational studies; Dawid further uses them for changes in parameters.
The three examples as selection diagrams (Fig. 4).
| Fig. | Story | Where points | Formula dictated |
|---|---|---|---|
| 4(a) | populations differ in age distribution (Example 1) | ( = age); no arrow into | (3.1) |
| 4(b) | populations differ in how (reading skill) depends on unmeasured age; age distribution the same (Example 2) | , | (3.2) direct transport |
| 4(c) | populations differ in how depends on (Example 3) | with | (3.4) |
All three also contain dashed arcs for latent confounders. The location of makes the difference: the same observed yields (3.1) in 4(a) and (3.2) in 4(b).
4.2 Transportability
Definition 5 (Transportability)
Let be a selection diagram relative to domains . Let be the pair of observational and interventional distributions of , and the observational distribution of . The causal relation is transportable from to in if is uniquely computable from in any model that induces .
Two connections to identifiability:
- All identifiable causal relations in are transportable, since they can be computed directly from with no experimental information from .
- Given a causal diagram , one can produce such that identifiability in equals transportability in : set and add selection nodes pointing to all variables, meaning the target shares no mechanism with the source. Then the only way to achieve transportability is to identify from scratch in the target.
Proofs of nontransportability are more involved than proofs of non-identifiability, because they require demonstrating the nonexistence of two competing models compatible with , agreeing on and disagreeing on . Definition 5 is declarative; Theorem 1 gives a method.
Theorem 1 (do-calculus criterion for transportability)
Let be the selection diagram characterizing and , and a set of selection variables in . The relation is transportable from to if the expression is reducible, using the rules of do-calculus, to an expression in which appears only as a conditioning variable in do-free terms.
Proof
Every relation satisfying the condition can be written as an algebraic combination of two kinds of terms: those involving and those not. The former can be written as -terms and are therefore estimable from observations on , as Definition 5 requires. All other terms, especially those involving -operators, do not contain ; they are experimentally identifiable in .
Status. The criterion is sufficient and necessary for causal effects (Bareinboim and Pearl 2012). Theorem 1 is procedural: it does not say which sequence of rules reaches the reduction. Bareinboim and Pearl (2013b) gave a complete procedural solution based on graphical methods developed in Tian and Pearl (2002) and Shpitser and Pearl (2006), but it is non-trivial, so the paper takes an alternative route to a simple transparent procedure guided by two subgoals: trivial and direct transportability.
Definition 6 (Trivial transportability)
A causal relation is trivially transportable from to if is identifiable from .
An ordinary graphical identifiability test (Definition 2) on the target diagram; it estimates directly from observational studies on , unaided by causal information from .
Example 4
Let and let the selection diagram be . Then is trivially transportable since (no confounding of and in the target).
Definition 7 (Direct transportability)
A causal relation is directly transportable from to if .
Graphical test. For , direct transportability follows from do-calculus and reads: . In words, blocks all paths from to once arrows pointing to are removed and is conditioned on. It is satisfied in Fig. 4(a): the -specific effect is the same in both populations, hence directly transportable.
Remark: Manski's external validity = direct transportability
The notion of “external validity” defined by Manski (2007) (footnote 1 in Pearl 2014 - Threats vs Licenses and SCM Preliminaries) corresponds to Direct Transportability: retains its validity without adjustment, as in Eq. (3.2). Such conditions preclude using information from to recalibrate .
Example 5
Let be the causal effect of on , and let have a single -node pointing to . Then is directly transportable, because causal effects are independent of the selection mechanism (Pearl 2009b, pp. 72-73): differences in how treatment is assigned do not matter, since overrides the assignment mechanism.
Example 6
Let where is a set of variables and differ only in the conditional probabilities and , with , as in Fig. 4(b). Then is not directly transportable. However, the -specific effects are directly transportable, and so is . Due to confounding arcs, none of these quantities is identifiable (in alone).
Hierarchy of transport notions (summary).
| Notion | Condition | Needs target data? | Needs source experiment? |
|---|---|---|---|
| Trivial (Def. 6) | identifiable from | yes, observational only | no |
| Direct (Def. 7) | ( for -specific effects) | no | yes |
| General (Def. 5) | reducible per Thm 1 | observational | yes |
Examples
Marketing reading of Definitions 6 and 7
Trivial: if the new market’s ad exposure is effectively randomized by a platform lottery (no confounding of and ), you can read the effect off the target market’s own data; no transport needed. Direct: if the only difference between test and rollout markets is how media buyers allocated spend (an -node into ), Example 5 says the experiment’s effect transfers without adjustment, because the experiment’s randomization washed away the allocation rule.
Connections
- Motivation: Pearl 2014 - Motivating Examples and Transport Formulas. Next, the usable theorems: Pearl 2014 - S-Admissibility and the Graphical Criterion.
- Selection-diagram syntax is reused for sampling selection in Bareinboim 2016 - Sample Selection Bias and Recoverability and for multiple sources in Bareinboim 2016 - Transportability and Data Fusion.
- Estimator-level cousin of ” with no ”: the conditional-exchangeability-for-selection assumption in Degtiar 2023 - Identifying Assumptions.
- Identification background: DAGs and Causal Identification.