Improving Efficiency and Accuracy of Causal Discovery Using a Hierarchical Wrapper

by   Shami Nisimov, et al.

Causal discovery from observational data is an important tool in many branches of science. Under certain assumptions it allows scientists to explain phenomena, predict, and make decisions. In the large sample limit, sound and complete causal discovery algorithms have been previously introduced, where a directed acyclic graph (DAG), or its equivalence class, representing causal relations is searched. However, in real-world cases, only finite training data is available, which limits the power of statistical tests used by these algorithms, leading to errors in the inferred causal model. This is commonly addressed by devising a strategy for using as few as possible statistical tests. In this paper, we introduce such a strategy in the form of a recursive wrapper for existing constraint-based causal discovery algorithms, which preserves soundness and completeness. It recursively clusters the observed variables using the normalized min-cut criterion from the outset, and uses a baseline causal discovery algorithm during backtracking for learning local sub-graphs. It then combines them and ensures completeness. By an ablation study, using synthetic data, and by common real-world benchmarks, we demonstrate that our approach requires significantly fewer statistical tests, learns more accurate graphs, and requires shorter run-times than the baseline algorithm.


Characterization and Learning of Causal Graphs with Small Conditioning Sets

Constraint-based causal discovery algorithms learn part of the causal gr...

Accelerating Recursive Partition-Based Causal Structure Learning

Causal structure discovery from observational data is fundamental to the...

Iterative Causal Discovery in the Possible Presence of Latent Confounders and Selection Bias

We present a sound and complete algorithm, called iterative causal disco...

Local Causal Discovery for Estimating Causal Effects

Even when the causal graph underlying our data is unknown, we can use ob...

From Temporal to Contemporaneous Iterative Causal Discovery in the Presence of Latent Confounders

We present a constraint-based algorithm for learning causal structures f...

Self-Compatibility: Evaluating Causal Discovery without Ground Truth

As causal ground truth is incredibly rare, causal discovery algorithms a...

Tearing Apart NOTEARS: Controlling the Graph Prediction via Variance Manipulation

Simulations are ubiquitous in machine learning. Especially in graph lear...

Please sign up or login with your details

Forgot password? Click here to reset