Diffusion Models for Causal Discovery via Topological Ordering

by   Pedro Sanchez, et al.

Discovering causal relations from observational data becomes possible with additional assumptions such as considering the functional relations to be constrained as nonlinear with additive noise. In this case, the Hessian of the data log-likelihood can be used for finding leaf nodes in a causal graph. Topological ordering approaches for causal discovery exploit this by performing graph discovery in two steps, first sequentially identifying nodes in reverse order of depth (topological ordering), and secondly pruning the potential relations. This is more efficient since the search is performed over a permutation rather than a graph space. However, existing computational methods for obtaining the Hessian still do not scale as the number of variables and the number of samples are increased. Therefore, inspired by recent innovations in diffusion probabilistic models (DPMs), we propose DiffAN, a topological ordering algorithm that leverages DPMs. Further, we introduce theory for updating the learned Hessian without re-training the neural network, and we show that computing with a subset of samples gives an accurate approximation of the ordering, which allows scaling to datasets with more samples and variables. We show empirically that our method scales exceptionally well to datasets with up to 500 nodes and up to 10^5 samples while still performing on par over small datasets with state-of-the-art causal discovery methods. Implementation is available at https://github.com/vios-s/DiffAN .


page 1

page 2

page 3

page 4


Conditional Independences and Causal Relations implied by Sets of Equations

Real-world systems are often modelled by sets of equations with exogenou...

Simple Sorting Criteria Help Find the Causal Order in Additive Noise Models

Additive Noise Models (ANM) encode a popular functional assumption that ...

Ordering-Based Causal Discovery with Reinforcement Learning

It is a long-standing question to discover causal relations among a set ...

Causal Autoregressive Flows

Two apparently unrelated fields – normalizing flows and causality – have...

Hierarchical Topological Ordering with Conditional Independence Test for Limited Time Series

Learning directed acyclic graphs (DAGs) to identify causal relations und...

Autoregressive flow-based causal discovery and inference

We posit that autoregressive flow models are well-suited to performing a...

Greedy Relaxations of the Sparsest Permutation Algorithm

There has been an increasing interest in methods that exploit permutatio...

Please sign up or login with your details

Forgot password? Click here to reset