Differentiable Invariant Causal Discovery
Not on the map. Why?
Abstract (arXiv)
Learning causal structure from observational data is a fundamental challenge in machine learning. However, the majority of commonly used differentiable causal discovery methods are non-identifiable, turning this problem into a continuous optimization task prone to data biases. In many real-life situations, data is collected from different environments, in which the functional relations remain consistent across environments, while the distribution of additive noises may vary. This paper proposes Differentiable Invariant Causal Discovery (DICD), utilizing the multi-environment information based on a differentiable framework to avoid learning spurious edges and wrong causal directions. Specifically, DICD aims to discover the environment-invariant causation while removing the environment-dependent correlation. We further formulate the constraint that enforces the target structure equation model to maintain optimal across the environments. Theoretical guarantees for the identifiability of proposed DICD are provided under mild conditions with enough environments. Extensive experiments on synthetic and real-world datasets verify that DICD outperforms state-of-the-art causal discovery methods up to 36% in SHD. Our code will be open-sourced.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 27 of its 54 references that are in the map. First posted on arXiv 31 May 2022.
Builds on
27 of 54 references.
References · 27
- 2019Invariant Risk Minimizationcited by 1,854
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 742
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 536
- 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 331
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2020PGM-Explainer: Probabilistic Graphical Model Explanations for Graph Neural Networkscited by 211
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 191
- 2013Learning Bayesian Networks: The Combination of Knowledge and Statistical Datacited by 187
15 more
- 2019RUBi: Reducing Unimodal Biases in Visual Question Answeringcited by 185
- 2013Causal Inference in the Presence of Latent Variables and Selection Biascited by 166
- 2019Causal Discovery from Heterogeneous/Nonstationary Data with Independent Changescited by 166
- 2019Causal Discovery with Reinforcement Learningcited by 145
- 2019CXPlain: Causal Explanations for Model Interpretation under Uncertaintycited by 98
- 2021Efficient Neural Causal Discovery without Acyclicity Constraintscited by 82
- 2020DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networkscited by 66
- 2020Differentiable Causal Discovery Under Unmeasured Confoundingcited by 56
- 2014Constraint-based Causal Discovery from Multiple Interventions over Overlapping Variable Setscited by 48
- 2019Causal Discovery and Forecasting in Nonstationary Environments with State-Space Modelscited by 45
- 2017Learning Causal Structures Using Regression Invariancecited by 32
- 2021Towards Federated Bayesian Network Structure Learning with Continuous Optimizationcited by 31
- 2019Integer Programming for Learning Directed Acyclic Graphs from Continuous Datacited by 20
- 2014Advances in Learning Bayesian Networks of Bounded Treewidthcited by 10
- 2020Learning DAGs without imposing acyclicitycited by 10
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.
3 papers.