Results 1 - 10
of
36
Appendum to Identification of Conditional Interventional Distributions
, 2007
"... The subject of this paper is the elucidation of effects of actions from causal assumptions represented as a directed graph, and statistical knowledge given as a probability distribution. In particular, we are interested in predicting distributions on post-action outcomes given a set of measurements. ..."
Abstract
-
Cited by 33 (20 self)
- Add to MetaCart
The subject of this paper is the elucidation of effects of actions from causal assumptions represented as a directed graph, and statistical knowledge given as a probability distribution. In particular, we are interested in predicting distributions on post-action outcomes given a set of measurements. We provide a necessary and sufficient graphical condition for the cases where such distributions can be uniquely computed from the available information, as well as an algorithm which performs this computation whenever the condition holds. Furthermore, we use our results to prove completeness of do-calculus [Pearl, 1995] for the same identification problem, and show applications to sequential decision making. 1
Identification of joint interventional distributions in recursive semimarkovian causal models
- In Twenty-First National Conference on Artificial Intelligence
, 2006
"... This paper is concerned with estimating the effects of actions from causal assumptions, represented concisely as a directed graph, and statistical knowledge, given as a probability distribution. We provide a necessary and sufficient graphical condition for the cases when the causal effect of an arbi ..."
Abstract
-
Cited by 25 (11 self)
- Add to MetaCart
This paper is concerned with estimating the effects of actions from causal assumptions, represented concisely as a directed graph, and statistical knowledge, given as a probability distribution. We provide a necessary and sufficient graphical condition for the cases when the causal effect of an arbitrary set of variables on another arbitrary set can be determined uniquely from the available information, as well as an algorithm which computes the effect whenever this condition holds. Furthermore, we use our results to prove completeness of do-calculus [Pearl, 1995], and a version of an identification algorithm in [Tian, 2002] for the same identification problem.
Causal inference in statistics: An overview
- Statistics Surveys
"... Abstract: This review presents empirical researchers with recent advances in causal inference, and stresses the paradigmatic shifts that must be undertaken in moving from traditional statistical analysis to causal analysis of multivariate data. Special emphasis is placed on the assumptions that unde ..."
Abstract
-
Cited by 12 (8 self)
- Add to MetaCart
Abstract: This review presents empirical researchers with recent advances in causal inference, and stresses the paradigmatic shifts that must be undertaken in moving from traditional statistical analysis to causal analysis of multivariate data. Special emphasis is placed on the assumptions that underly all causal inferences, the languages used in formulating those assumptions, the conditional nature of all causal and counterfactual claims, and the methods that have been developed for the assessment of such claims. These advances are illustrated using a general theory of causation based on the Structural Causal Model (SCM) described in Pearl (2000a), which subsumes and unifies other approaches to causation, and provides a coherent mathematical foundation for the analysis of causes and counterfactuals. In particular, the paper surveys the development of mathematical tools for inferring (from a combination of data and assumptions) answers to three types of causal queries: (1) queries about the effects of potential interventions, (also called “causal effects ” or “policy evaluation”) (2) queries about probabilities of counterfactuals, (including assessment of “regret, ” “attribution” or “causes of effects”) and (3) queries about direct and indirect effects (also known as “mediation”). Finally, the paper defines the formal and conceptual relationships between the structural and potential-outcome frameworks and presents tools for a symbiosis analysis that uses the strong features of both.
Identifiability in causal bayesian networks: A sound and complete algorithm
- In Twenty-First National Conference on Artificial Intelligence
, 2006
"... ..."
Dormant independence
- In Proceedings of the Twenty-Third Conference on Artificial Intelligence
, 2008
"... The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the graph. These constraints are of two types: conditional independencies and algebraic constraints, first noted by Verma. Whil ..."
Abstract
-
Cited by 10 (9 self)
- Add to MetaCart
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the graph. These constraints are of two types: conditional independencies and algebraic constraints, first noted by Verma. While conditional independencies are well studied and frequently used in causal induction algorithms, Verma constraints are still poorly understood, and rarely applied. In this paper we examine a special subset of Verma constraints which are easy to understand, easy to identify and easy to apply; they arise from “dormant independencies, ” namely, conditional independencies that hold in interventional distributions. We give a complete algorithm for determining if a dormant independence between two sets of variables is entailed by the causal graph, such that this independence is identifiable, in other words if it resides in an interventional distribution that can be predicted without resorting to interventions. We further show the usefulness of dormant independencies in model testing and induction by giving an algorithm that uses constraints entailed by dormant independencies to prune extraneous edges from a given causal graph.
Effects of treatment on the treated: Identification and generalization
- In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
, 2009
"... Many applications of causal analysis call for assessing, retrospectively, the effect of withholding an action that has in fact been implemented. This counterfactual quantity, sometimes called “effect of treatment on the treated, ” (ETT) have been used to to evaluate educational programs, critic publ ..."
Abstract
-
Cited by 10 (5 self)
- Add to MetaCart
Many applications of causal analysis call for assessing, retrospectively, the effect of withholding an action that has in fact been implemented. This counterfactual quantity, sometimes called “effect of treatment on the treated, ” (ETT) have been used to to evaluate educational programs, critic public policies, and justify individual decision making. In this paper we explore the conditions under which ETT can be estimated from (i.e., identified in) experimental and/or observational studies. We show that, when the action invokes a singleton variable, the conditions for ETT identification have simple characterizations in terms of causal diagrams. We further give a graphical characterization of the conditions under which the effects of multiple treatments on the treated can be identified, as well as ways in which the ETT estimand can be constructed from both interventional and observational distributions. 1
Identifying Conditional Causal Effects
- In Conference on Uncertainty in Artificial Intelligence (UAI
, 2004
"... This paper concerns the assessment of the effects of actions from a combination of nonexperimental data and causal assumptions encoded in the form of a directed acyclic graph in which some variables are presumed to be unobserved. We provide a procedure that systematically identifies cause effects be ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
This paper concerns the assessment of the effects of actions from a combination of nonexperimental data and causal assumptions encoded in the form of a directed acyclic graph in which some variables are presumed to be unobserved. We provide a procedure that systematically identifies cause effects between two sets of variables conditioned on some other variables, in time polynomial in the number of variables in the graph. The identifiable conditional causal effects are expressed in terms of the observed joint distribution. 1
Transportability across studies: A formal approach
, 2010
"... We provide a formal definition of the notion of “transportability, ” or “external validity, ” which we view as a license to transfer causal information learned in experimental studies to a different environment, in which only observational studies can be conducted. We introduce a formal representati ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
We provide a formal definition of the notion of “transportability, ” or “external validity, ” which we view as a license to transfer causal information learned in experimental studies to a different environment, in which only observational studies can be conducted. We introduce a formal representation called “selection diagrams ” for expressing knowledge about differences and commonalities between populations of interest and, using this representation, we derive procedures for deciding whether causal effects in the target environment can be inferred from experimental findings in a different environment. When the answer is affirmative, the procedures identify the set of experimental and observational studies that need be conducted to license the transport. We further demonstrate how transportability analysis can guide the transfer of knowledge among non-experimental studies to minimize re-measurement cost and improve prediction power. We further provide a causally principled definition of “surrogate endpoint ” and show that the theory of transportability can assist the identification of valid surrogates in a complex network of cause-effect relationships. 1 Introduction: Threats
Identification of Causal Effects in Multi-Agent Causal Models
- In Proceedings of the 2003 IEEE/WIC International Conference on Intelligent Agent Technology (IAT
, 2005
"... In this paper we introduce multi-agent causal models (MACMs) which are an extension of causal Bayesian networks to a multi-agent setting. Instead of 1 single agent modeling the entire domain, there are several agents each modeling non-disjoint subsets of the domain. Every agent has a causal model, d ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
In this paper we introduce multi-agent causal models (MACMs) which are an extension of causal Bayesian networks to a multi-agent setting. Instead of 1 single agent modeling the entire domain, there are several agents each modeling non-disjoint subsets of the domain. Every agent has a causal model, determined by an acyclic causal diagram and a joint probability distribution over its observed variables.

