Learning Identifiable Structures Helps Avoid Bias in DNN-based Supervised Causal Learning
Not on the map. Why?
Abstract (arXiv)
Causal discovery is a structured prediction task that aims to predict causal relations among variables based on their data samples. Supervised Causal Learning (SCL) is an emerging paradigm in this field. Existing Deep Neural Network (DNN)-based methods commonly adopt the "Node-Edge approach", in which the model first computes an embedding vector for each variable-node, then uses these variable-wise representations to concurrently and independently predict for each directed causal-edge. In this paper, we first show that this architecture has some systematic bias that cannot be mitigated regardless of model size and data size. We then propose SiCL, a DNN-based SCL method that predicts a skeleton matrix together with a v-tensor (a third-order tensor representing the v-structures). According to the Markov Equivalence Class (MEC) theory, both the skeleton and the v-structures are identifiable causal structures under the canonical MEC setting, so predictions about skeleton and v-structures do not suffer from the identifiability limit in causal discovery, thus SiCL can avoid the systematic bias in Node-Edge architecture, and enable consistent estimators for causal discovery. Moreover, SiCL is also equipped with a specially designed pairwise encoder module with a unidirectional attention layer to model both internal and external relationships of pairs of nodes. Experimental results on both synthetic and real-world benchmarks show that SiCL significantly outperforms other DNN-based SCL approaches.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 24 of its 57 references that are in the map. First posted on arXiv 15 Feb 2025.
Builds on
24 of 57 references.
References · 24
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 329
- 2013Causal Discovery with Continuous Additive Noise Modelscited by 252
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2021D'ya like DAGs? A Survey on Structure Learning and Causal Discoverycited by 209
- 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 186
- 2013Causal Inference and Causal Explanation with Background Knowledgecited by 168
- 2019Causal Discovery with Reinforcement Learningcited by 145
- 2023Causal-learn: Causal Discovery in Pythoncited by 108
- 2022Deep End-to-end Causal Inferencecited by 93
- 2022Amortized Inference for Causal Structure Learningcited by 89
- 2021Efficient Neural Causal Discovery without Acyclicity Constraintscited by 82
12 more
- 2016Discovering Causal Signals in Imagescited by 79
- 2022Learning to Induce Causal Structurecited by 68
- 2021gCastle: A Python Toolbox for Causal Discoverycited by 60
- 2022On the Identifiability and Estimation of Causal Location-Scale Noise Modelscited by 56
- 2022Differentiable DAG Samplingcited by 46
- 2015A fast PC algorithm for high dimensional causal discovery with multi-core PCscited by 45
- 2013Strong Completeness and Faithfulness in Bayesian Networkscited by 44
- 2021ML4C: Seeing Causality Through Latent Vicinitycited by 11
- 2014The Randomized Causation Coefficientcited by 10
- 2022Causal discovery for observational sciences using supervised machine learningcited by 10
- 2023Discovering Mixtures of Structural Causal Models from Time Series Datacited by 10
- 2016A Review on Algorithms for Constraint-based Causal Discoverycited by 8
Built on by
Citing papers per year: 2026: 3.
3 papers.