Dagma-DCE: Interpretable, Non-Parametric Differentiable Causal Discovery
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 to existing differentiable causal discovery algorithms, \textsc{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 \textsc{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.
- Judea Pearl, Causality, Cambridge University Press, 2009.
- Elements of Causal Inference: Foundations and Learning Algorithms, Adaptive Computation and Machine Learning Series. MIT Press, 2017.
- Causation, Prediction, and Search, MIT Press, 2000.
- “Detection of unfaithfulness and robust causal inference,” Minds and Machines, vol. 18, pp. 239–271, 2008.
- David Maxwell Chickering, “Optimal structure identification with greedy search,” Journal of Machine Learning Research, vol. 3, pp. 507–554, 2002.
- “DAGs with NO TEARS: Continuous optimization for structure learning,” Advances in Neural Information Processing Systems, vol. 31, 2018.
- “Learning sparse nonparametric DAGs,” in International Conference on Artificial Intelligence and Statistics. PMLR, 2020, pp. 3414–3425.
- “DAGMA: Learning DAGs via M-matrices and a log-determinant acyclicity characterization,” Advances in Neural Information Processing Systems, vol. 35, pp. 8226–8239, 2022.
- “A differential measure of the strength of causation,” IEEE Signal Processing Letters, vol. 29, pp. 2208–2212, 2022.
- “A linear non-Gaussian acyclic model for causal discovery.,” Journal of Machine Learning Research, vol. 7, no. 10, 2006.
- “Causal discovery with continuous additive noise models,” Journal of Machine Learning Research, vol. 15, pp. 2009–2053, 2014.
- “D’ya like DAGS? A survey on structure learning and causal discovery,” ACM Computing Surveys, vol. 55, no. 4, pp. 1–36, 2022.
- OEIS Foundation Inc., “The On-Line Encyclopedia of Integer Sequences,” 2023, Published electronically at http://oeis.org.
- “DAGs with No Fears: a closer look at continuous optimization for learning Bayesian networks,” Advances in Neural Information Processing Systems, vol. 33, pp. 3895–3906, 2020.
- “Parameter identifiability of a deep feedforward ReLU neural network,” arXiv preprint arXiv:2112.12982, 2021.
- “How to define reasonably weighted Sobolev spaces,” Commentationes Mathematicae Universitatis Carolinae, vol. 025, no. 3, pp. 537–554, 1984.
- Gaussian Processes for Machine Learning, Adaptive Computation and Machine Learning series. MIT Press, 2005.
- “NTS-NOTEARS: Learning nonparametric DBNs with prior knowledge,” in International Conference on Artificial Intelligence and Statistics. PMLR, 2023, pp. 1942–1964.
- “Adam: A method for stochastic optimization,” in International Conference on Learning Representations (ICLR), San Diega, CA, USA, 2015.
- “Quantifying causal influences,” The Annals of Statistics, vol. 41, no. 5, pp. 2324–2358, 2013.
- Elliott Sober, “Apportioning causal responsibility,” The Journal of Philosophy, vol. 85, no. 6, pp. 303–318, 1988.
- “Estimation of Granger causality of state-space models using a clustering with Gaussian mixture model,” in 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC). IEEE, 2019, pp. 3853–3858.
- “Granger causality pattern learning equipped with noise invalidation soft thresholding,” in 2023 31st European Signal Processing Conference (EUSIPCO). IEEE, 2023, pp. 2028–2032.
- “Structural intervention distance for evaluating causal graphs,” Neural Computation, vol. 27, no. 3, pp. 771–799, 2015.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.