Cost-Optimal Learning of Causal Graphs

Author name not available (Why is that?)

Publication date: 7 March 2017

Abstract: We consider the problem of learning a causal graph over a set of variables with interventions. We study the cost-optimal causal graph learning problem: For a given skeleton (undirected version of the causal graph), design the set of interventions with minimum total cost, that can uniquely identify any causal graph with the given skeleton. We show that this problem is solvable in polynomial time. Later, we consider the case when the number of interventions is limited. For this case, we provide polynomial time algorithms when the skeleton is a tree or a clique tree. For a general chordal skeleton, we develop an efficient greedy algorithm, which can be improved when the causal graph skeleton is an interval graph.

Has companion code repository: https://github.com/cxjdavin/adaptivity-complexity-for-causal-graph-discovery

This page was built for publication: Cost-Optimal Learning of Causal Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284032)