Experimental Design for Cost-Aware Learning of Causal Graphs

We consider the minimum cost intervention design problem: Given the essential graph of a causal graph and a cost to intervene on a variable, identify the set of interventions with minimum total cost that can learn any causal graph with the given essential graph. We first show that this problem is NP-hard. We then prove that we can achieve a constant factor approximation to this problem with a greedy algorithm. We then constrain the sparsity of each intervention. We develop an algorithm that returns an intervention design that is nearly optimal in terms of size for sparse graphs with sparse interventions and we discuss how to use it when there are costs on the vertices.

[1]  Mathias Frisch,et al.  Causation and intervention , 2014 .

[2]  Adrian Vetta,et al.  Randomized Experimental Design for Causal Graph Discovery , 2014, NIPS.

[3]  Frederick Eberhardt,et al.  Experiment selection for causal discovery , 2013, J. Mach. Learn. Res..

[4]  Frederick Eberhardt,et al.  On the Number of Experiments Sufficient and in the Worst Case Necessary to Identify All Causal Relations Among N Variables , 2005, UAI.

[5]  D. Rubin,et al.  Causal Inference for Statistics, Social, and Biomedical Sciences: An Introduction , 2016 .

[6]  Christopher H. Bryant,et al.  Functional genomic hypothesis generation and experimentation by a robot scientist , 2004, Nature.

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

[8]  Clark Glymour,et al.  A million variables and more: the Fast Greedy Equivalence Search algorithm for learning high-dimensional graphical causal models, with an application to functional magnetic resonance images , 2016, International Journal of Data Science and Analytics.

[9]  Klaus Jansen,et al.  The Optimum Cost Chromatic Partition Problem , 1997, CIAC.

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

[11]  David Sontag,et al.  Learning a Health Knowledge Graph from Electronic Medical Records , 2017, Scientific Reports.

[12]  Leo G. Kroon,et al.  The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs , 1996, WG.

[13]  David Heckerman,et al.  Learning Gaussian Networks , 1994, UAI.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Elias Bareinboim,et al.  Budgeted Experiment Design for Causal Structure Learning , 2017, ICML.

[16]  Alexandros G. Dimakis,et al.  Cost-Optimal Learning of Causal Graphs , 2017, ICML.

[17]  Mark Craven,et al.  A review of active learning approaches to experimental design for uncovering biological networks , 2017, PLoS Comput. Biol..

[18]  G. Katona.  On separating systems of a finite set , 1966 .

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

[20]  Olga Vitek,et al.  A Bayesian Active Learning Experimental Design for Inferring Signaling Networks , 2017, RECOMB.

[21]  Javier Marenco,et al.  Polyhedral studies of vertex coloring problems: The standard formulation , 2016, Discret. Optim..

[22]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[23]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[24]  K. Sachs,et al.  Causal Protein-Signaling Networks Derived from Multiparameter Single-Cell Data , 2005, Science.

[25]  Donald B. Rubin,et al.  Estimating the Causal Effects of Marketing Interventions Using Propensity Score Methodology , 2006 .

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

[27]  Russell A. Poldrack,et al.  Six problems for causal inference from fMRI , 2010, NeuroImage.

[28]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[29]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[30]  Alexandros G. Dimakis,et al.  Learning Causal Graphs with Small Interventions , 2015, NIPS.

[31]  Cai Mao-cheng,et al.  On separating systems of graphs , 1984 .