• Corpus ID: 235254240

Near-Optimal Multi-Perturbation Experimental Design for Causal Structure Learning

  title={Near-Optimal Multi-Perturbation Experimental Design for Causal Structure Learning},
  author={Scott Sussex and Andreas Krause and Caroline Uhler},
Causal structure learning is a key problem in many domains. Causal structures can be learnt by performing experiments on the system of interest. We address the largely unexplored problem of designing experiments that simultaneously intervene on multiple variables. While potentially more informative than the commonly considered single-variable interventions, selecting such interventions is algorithmically much more challenging, due to the doubly-exponential combinatorial search space over sets… 
Interventions, Where and How? Experimental Design for Causal Models at Scale
This paper incorporates recent advances in Bayesian causal discovery into the Bayesian optimal experimental design framework, which allows for active causal discovery of nonlinear, large SCMs, while selecting both the target and the value to intervene with.
Submodular Maximization in Clean Linear Time
In this paper, we provide the first deterministic algorithm that achieves the tight 1 − 1 /e approximation guarantee for submodular maximization under a cardinality (size) constraint while making a


Budgeted Experiment Design for Causal Structure Learning
This work forms the problem of finding the best intervention target set as an optimization problem, which aims to maximize the average number of edges whose directions are resolved, and proves that the corresponding objective function is submodular and a greedy algorithm suffices to achieve the optimal value.
ABCD-Strategy: Budgeted Experimental Design for Targeted Causal Structure Discovery
This work proposes a general framework and theory based on optimal Bayesian experimental design to select experiments for targeted causal discovery and provides a tractable implementation with provable guarantees on both approximation and optimization quality based on submodularity.
Interventional Experiment Design for Causal Structure Learning
This work considers a setup in which given a budget $k, the problem of finding the best intervention target set as an optimization problem which aims to maximize the number of edges whose directions are identified due to the performed interventions, and proposes an efficient exact calculator as well as two estimators for this task.
Learning Causal Graphs with Small Interventions
It is proved that any deterministic adaptive algorithm needs to be a separating system in order to learn complete graphs in the worst case, and a novel information theoretic lower bound on the number of interventions applies in full generality, including for randomized adaptive learning algorithms.
Experimental Design for Cost-Aware Learning of Causal Graphs
An algorithm is developed that returns an intervention design that is nearly optimal in terms of size for sparse graphs with sparse interventions and how to use it when there are costs on the vertices is discussed.
Characterizing and Learning Equivalence Classes of Causal DAGs under Interventions
This paper defines and characterize the interventional Markov equivalence class that can be identified from general (not necessarily perfect) intervention experiments and proposes the first provably consistent algorithm for learning DAGs in this setting.
Experiment selection for causal discovery
For a variety of settings, the theoretical results are translated and explicit constructions of the optimal set of experiments are given and some of the general combinatorics results are adapted to answer questions relating to the problem of experiment selection.
Identifiability and experimental design in perturbation studies
A framework that allows to infer a maximal number of interaction strengths with a minimal number of perturbation experiments is provided and the theory of matroids is used to describe identifiability relationships between sets of parameters in order to build identifiable effective network models.
Permutation-based Causal Inference Algorithms with Interventions
These algorithms are interventional adaptations of the Greedy SP algorithm and are the first algorithms using both observational and interventional data with consistency guarantees and have the advantage that they are nonparametric, which makes them useful also for analyzing non-Gaussian data.
Cost-Optimal Learning of Causal Graphs
This work develops an efficient greedy algorithm, which can be improved when the causal graph skeleton is an interval graph, and provides polynomial time algorithms when the skeleton is a tree or a clique tree.