Abstract
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 with existing differentiable causal discovery algorithms, Dagma-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 Dagma-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.
| Original language | English |
|---|---|
| Pages (from-to) | 393-401 |
| Number of pages | 9 |
| Journal | IEEE Open Journal of Signal Processing |
| Volume | 5 |
| DOIs | |
| State | Published - 2024 |
Keywords
- Causal discovery
- differential causal effect
- interpretable machine learning
Fingerprint
Dive into the research topics of 'Dagma-DCE: Interpretable, Non-Parametric Differentiable Causal Discovery'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver