A Graph Autoencoder Approach to Causal Structure Learning
About
Causal structure learning has been a challenging task in the past decades and several mainstream approaches such as constraint- and score-based methods have been studied with theoretical guarantees. Recently, a new approach has transformed the combinatorial structure learning problem into a continuous one and then solved it using gradient-based optimization methods. Following the recent state-of-the-arts, we propose a new gradient-based method to learn causal structures from observational data. The proposed method generalizes the recent gradient-based methods to a graph autoencoder framework that allows nonlinear structural equation models and is easily applicable to vector-valued variables. We demonstrate that on synthetic datasets, our proposed method outperforms other gradient-based methods significantly, especially on large causal graphs. We further investigate the scalability and efficiency of our method, and observe a near linear training time when scaling up the graph size.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| DAG Structure Recovery | non-linear-1 5000 samples | SHD8.6 | 48 | |
| Causal Discovery | non-linear-2 d=10, 5000 samples (test) | SHD7.3 | 12 | |
| Causal Discovery | non-linear-2 (d=20, 5000 samples) (test) | SHD17.4 | 12 | |
| Causal Discovery | non-linear-2 d=50, 5000 samples (test) | Structural Hamming Distance33.7 | 12 | |
| Causal Discovery | non-linear-2 d=100, 5000 samples (test) | Structural Hamming Distance (SHD)88.4 | 12 | |
| Causal Structure Learning | Linear Synthetic Data d=10 5000 samples | SHD5.5 | 12 | |
| Causal Structure Learning | Linear Synthetic Data d=20, 5000 samples | SHD10.3 | 12 | |
| Causal Structure Learning | Linear Synthetic Data d=50, 5000 samples | SHD31.3 | 12 | |
| Causal Structure Learning | Linear Synthetic Data d=100, 5000 samples | SHD80.2 | 12 | |
| DAG Structure Recovery | Sachs | SHD20 | 9 |