Local Causal Network Learning for Finding Pairs of Total and Direct Effects

In observational studies, it is important to evaluate not only the total effect but also the direct and indirect effects of a treatment variable on a response variable. In terms of local structural learning of causal networks, we try to find all possible pairs of total and direct causal effects, which can further be used to calculate indirect causal effects. An intuitive global learning approach is first to find an essential graph over all variables representing all Markov equivalent causal networks, and then enumerate all equivalent networks and estimate a pair of the total and direct effects for each of them. However, it could be inefficient to learn an essential graph and enumerate equivalent networks when the true causal graph is large. In this paper, we propose a local learning approach instead. In the local learning approach, we first learn locally a chain component containing the treatment. Then, if necessary, we learn locally a chain component containing the response. Next, we locally enumerate all possible pairs of the treatment’s parents and the response’s parents. Finally based on these pairs, we find all possible pairs of total and direct effects of the treatment on the response.

[1]  Bin Yu,et al.  Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs , 2015, J. Mach. Learn. Res..

[2]  Daniel Malinsky,et al.  Estimating bounds on causal effects in high-dimensional and possibly confounded systems , 2017, Int. J. Approx. Reason..

[3]  Jiji Zhang,et al.  On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias , 2008, Artif. Intell..

[4]  Vincenzo Lagani,et al.  On scoring Maximal Ancestral Graphs with the Max-Min Hill Climbing algorithm , 2018, Int. J. Approx. Reason..

[5]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[6]  David Maxwell Chickering,et al.  Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  David Maxwell Chickering,et al.  Learning Equivalence Classes of Bayesian Network Structures , 1996, UAI.

[9]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[10]  D. Madigan,et al.  A characterization of Markov equivalence classes for acyclic digraphs , 1997 .

[11]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[12]  Z. Geng,et al.  Discovering and orienting the edges connected to a target variable in a DAG via a sequential local learning approach , 2014, Comput. Stat. Data Anal..

[13]  Yue Liu,et al.  Collapsible IDA: Collapsing Parental Sets for Locally Estimating Possible Causal Effects , 2020, UAI.

[14]  Yangbo He,et al.  Active Learning of Causal Networks with Intervention Experiments and Optimal Designs , 2008 .

[15]  Arvid Sjölander,et al.  Bounds on natural direct effects in the presence of confounded intermediate variables , 2009, Statistics in medicine.

[16]  Thomas S. Richardson,et al.  Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables , 2005, UAI.

[17]  Gregory F. Cooper,et al.  The ALARM Monitoring System: A Case Study with two Probabilistic Inference Techniques for Belief Networks , 1989, AIME.

[18]  P. Holland.  Statistics and Causal Inference , 1985 .

[19]  Christopher Meek,et al.  Causal inference and causal explanation with background knowledge , 1995, UAI.

[20]  P. Spirtes,et al.  Ancestral graph Markov models , 2002 .

[21]  Marloes H. Maathuis,et al.  Interpreting and Using CPDAGs With Background Knowledge , 2017, UAI.

[22]  Peter Bühlmann,et al.  Causal Inference Using Graphical Models with the R Package pcalg , 2012 .

[23]  Zhuangyan Fang,et al.  IDA with Background Knowledge , 2020, UAI.

[24]  J. Pearl,et al.  Bounds on Direct Effects in the Presence of Confounded Intermediate Variables , 2008, Biometrics.

[25]  J. Pearl,et al.  Causal diagrams for epidemiologic research. , 1999, Epidemiology.

[26]  Steffen L. Lauritzen,et al.  Causal Inference from Graphical Models , 2001 .

[27]  David Maxwell Chickering,et al.  Optimal Structure Identification With Greedy Search , 2002, J. Mach. Learn. Res..

[28]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[29]  Constantin F. Aliferis,et al.  The max-min hill-climbing Bayesian network structure learning algorithm , 2006, Machine Learning.

[30]  Constantin F. Aliferis,et al.  Algorithms for Large Scale Markov Blanket Discovery , 2003, FLAIRS.

[31]  Peter Bühlmann,et al.  Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs (Abstract) , 2011, UAI.

[32]  Judea Pearl,et al.  Direct and Indirect Effects , 2001, UAI.

[33]  M. Maathuis,et al.  Estimating high-dimensional intervention effects from observational data , 2008, 0810.4214.

[34]  Tom Burr,et al.  Causation, Prediction, and Search , 2003, Technometrics.

[35]  M. Maathuis,et al.  Estimating the effect of joint interventions from observational data in sparse high-dimensional settings , 2014, 1407.2451.

[36]  Judea Pearl,et al.  Equivalence and Synthesis of Causal Models , 1990, UAI.