A General Algorithm for Deciding Transportability of Experimental Results

@inproceedings{Bareinboim2013AGA,
  title={A General Algorithm for Deciding Transportability of Experimental Results},
  author={Elias Bareinboim and Judea Pearl},
  booktitle={ArXiv},
  year={2013}
}
Abstract Generalizing empirical findings to new environments, settings, or populations is essential in most scientific explorations. This article treats a particular problem of generalizability, called “transportability”, defined as a license to transfer information learned in experimental studies to a different population, on which only observational studies can be conducted. Given a set of assumptions concerning commonalities and differences between the two populations, Pearl and Bareinboim… Expand
External Validity: From Do-Calculus to Transportability Across Populations
TLDR
A formal representation called "selection diagrams" for expressing knowledge about differences and commonalities between populations of interest is introduced and questions of transportability are reduced to symbolic derivations in the do-calculus. Expand
Generalizability of causal and statistical relations
The problem of generalizability of empirical findings (experimental and observational) to new environments, settings, and populations is one of the central problems in causal inference. ExperimentsExpand
Transportability across studies: A formal approach
TLDR
It is demonstrated how transportability analysis can guide the transfer of knowledge among non-experimental studies to minimize re-measurement cost and improve prediction power. Expand
General Transportability of Soft Interventions: Completeness Results
TLDR
A graphical condition is developed that is both necessary and sufficient for deciding soft-transportability and an algorithm is developed to determine whether a non-atomic intervention is computable from a combination of the distributions available across domains. Expand
Generalizing Experimental Findings
Abstract This note examines one of the most crucial questions in causal inference: “How generalizable are randomized clinical trials?” The question has received a formal treatment recently, using aExpand
Transportability from Multiple Environments with Limited Experiments: Completeness Results
TLDR
It is proved that a previously established algorithm for computing transport formula is in fact complete, that is, failure of the algorithm implies non-existence of a transport formula, and the do-calculus is complete for the mz-transportability class. Expand
Causal Effect Identification from Multiple Incomplete Data Sources: A General Search-based Approach
TLDR
A search algorithm directly over the rules of do-calculus is presented, capable of taking more advanced data-generating mechanisms into account along with an arbitrary type of both observational and experimental source distributions and of handling missing data problems as well. Expand
Effect heterogeneity and variable selection for standardizing causal effects to a target population
TLDR
Several different types of homogeneity conditions that are relevant for standardization are discussed: Homogeneity of effect measures, homogeneity of counterfactual outcome state transition parameters, and homogeneous ofcounterfactual distributions. Expand
How Generalizable Is Your Experiment? An Index for Comparing Experimental Samples and Populations
Although a large-scale experiment can provide an estimate of the average causal impact for a program, the sample of sites included in the experiment is often not drawn randomly from the inferenceExpand
Do-calculus when the True Graph Is Unknown
TLDR
This article proposes a method for the identification of causal effects on the basis of arbitrary (equivalence) classes of semi-Markovian causal models and shows that the method is more efficient than determining causal effects using a naive enumeration of graphs in the equivalence class. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 77 REFERENCES
Transportability of Causal Effects: Completeness Results
TLDR
This paper establishes a necessary and sufficient condition for deciding when causal effects in the target domain are estimable from both the statistical information available and the causal information transferred from the experiments. Expand
Causal Transportability with Limited Experiments
TLDR
This paper establishes a necessary and sufficient condition for causal effects in the target domain to be estimable from both the non-experimental information available and the limited experimental information transferred from the source. Expand
Meta-Transportability of Causal Effects: A Formal Approach
TLDR
This paper provides a complete algorithm for computing the transport formula, that is, a way of fusing observational and experimental information to synthesize an unbiased estimate of the desired eects in the target domain. Expand
Transportability of Causal and Statistical Relations: A Formal Approach
  • J. Pearl, E. Bareinboim
  • Computer Science
  • 2011 IEEE 11th International Conference on Data Mining Workshops
  • 2011
TLDR
A formal representation called ``selection diagrams'' is introduced for expressing knowledge about differences and commonalities between environments and procedures for deciding whether effects in the target environment can be inferred from experiments conducted elsewhere are derived. Expand
Causal inference in statistics: An overview
This review presents empiricalresearcherswith recent advances in causal inference, and stresses the paradigmatic shifts that must be un- dertaken in moving from traditionalstatistical analysis toExpand
Compound Treatments and Transportability of Causal Inference
TLDR
The causal effect of compound treatments and their identifiability conditions are described and how such issues of “transportability” are related to the consistency condition in causal inference are discussed. Expand
Identifiability in Causal Bayesian Networks: A Sound and Complete Algorithm
TLDR
It is shown that the identify algorithm that Tian and Pearl define and prove sound for semi-Markovian models can be transfered to general causal graphs and is not only sound, but also complete, effectively solving the identifiability question for causal Bayesian networks. Expand
Studies in causal reasoning and learning
Building intelligent systems that can learn about and reason with causes and effects is a fundamental task in artificial intelligence. This dissertation addresses various issues in causal reasoningExpand
Causal Inference by Surrogate Experiments: z-Identifiability
TLDR
The problem of estimating the effect of intervening on a set of variables X from experiments on a different set, Z, that is more accessible to manipulation is addressed and a graphical necessary and sufficient condition for z-identifiability for arbitrary sets X,Z, and Y is provided. Expand
Identification of Causal Effects Using Instrumental Variables
TLDR
It is shown that the instrumental variables (IV) estimand can be embedded within the Rubin Causal Model (RCM) and that under some simple and easily interpretable assumptions, the IV estimand is the average causal effect for a subgroup of units, the compliers. Expand
...
1
2
3
4
5
...