• DOI:10.48550/arXiv.2210.06201
• Corpus ID: 252846166

Diffusion Models for Causal Discovery via Topological Ordering

@article{Sanchez2022DiffusionMF,
  title={Diffusion Models for Causal Discovery via Topological Ordering},
  author={Pedro Sanchez and Xiao Liu and Alison Q. O'Neil and Sotirios A. Tsaftaris},
  journal={ArXiv},
  year={2022},
  volume={abs/2210.06201}
}

• Pedro Sanchez, Xiao Liu, +1 author S. Tsaftaris
• Published 12 October 2022
• Computer Science
• ArXiv

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 ap-proaches 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. How-ever, 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 1 , 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.