Dagma-DCE: Interpretable, Non-Parametric Differentiable Causal Discovery
Not on the map. Why?
Abstract (arXiv)
We introduce Dagma-DCE, an interpretable and model-agnostic scheme for differentiable causal discovery. Current non- or over-parametric methods in differentiable causal discovery use opaque proxies of ``independence'' to justify the inclusion or exclusion of a causal relationship. We show theoretically and empirically that these proxies may be arbitrarily different than the actual causal strength. Juxtaposed to existing differentiable causal discovery algorithms, textscDagma-DCE uses an interpretable measure of causal strength to define weighted adjacency matrices. In a number of simulated datasets, we show our method achieves state-of-the-art level performance. We additionally show that textscDagma-DCE allows for principled thresholding and sparsity penalties by domain-experts. The code for our method is available open-source at https://github.com/DanWaxman/DAGMA-DCE, and can easily be adapted to arbitrary differentiable models.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 9 of its 23 references that are in the map. First posted on arXiv 5 Jan 2024.
Builds on
9 of 23 references.
References · 9
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
- 2013Causal Discovery with Continuous Additive Noise Modelscited by 255
- 2021D'ya like DAGs? A Survey on Structure Learning and Causal Discoverycited by 211
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2022DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterizationcited by 140
- 2020DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networkscited by 66
- 2021NTS-NOTEARS: Learning Nonparametric DBNs With Prior Knowledgecited by 33
- 2021Parameter identifiability of a deep feedforward ReLU neural networkcited by 24
Built on by
Citing papers per year: 2024: 3; 2025: 0; 2026: 3.
6 papers.
- 2024LLM-initialized Differentiable Causal Discoverycited by 6
- 2024ExDAG: an MIQP Algorithm for Learning DAGscited by 1
- 2024Kernel-Based Differentiable Learning of Non-Parametric Directed Acyclic Graphical Modelscited by 0
- 2026PRCD-MAP: Learning How Much to Trust Imperfect Priors in Causal Discoverycited by 0
- 2026EML-CD: Causal Mechanism Recovery via EML Symbolic Trees in Structure Learningcited by 0
- 2026Guide, Not Bind: Why Defeasible Priors Fail in Augmented Lagrangian Causal Discoverycited by 0
- 2026Guide, Not Bind: Why Defeasible Priors Fail in Augmented Lagrangian Causal Discovery3 Sep 2026
- 2026EML-CD: Causal Mechanism Recovery via EML Symbolic Trees in Structure Learning4 Jun 2026
- 2026PRCD-MAP: Learning How Much to Trust Imperfect Priors in Causal Discovery3 May 2026
- 2024LLM-initialized Differentiable Causal Discovery28 Oct 2024
- 2024Kernel-Based Differentiable Learning of Non-Parametric Directed Acyclic Graphical Models20 Aug 2024
- 2024ExDAG: an MIQP Algorithm for Learning DAGs21 Jun 2024