Author repository for the implementation of the NoGAM algorithm from the Causal Discovery with Score Matching on Additive Models with Arbitrary Noise CLeaR 2023 conference paper.

The code has been released as part of the dodiscover ecosystem. If you find NoGAM code useful for your work, please cite our paper:

@InProceedings{pmlr-v213-montagna23a,
  title = 	 {Causal Discovery with Score Matching on Additive Models with Arbitrary Noise},
  author =       {Montagna, Francesco and Noceti, Nicoletta and Rosasco, Lorenzo and Zhang, Kun and Locatello, Francesco},
  booktitle = 	 {Proceedings of the Second Conference on Causal Learning and Reasoning},
  pages = 	 {726--751},
  year = 	 {2023},
  editor = 	 {van der Schaar, Mihaela and Zhang, Cheng and Janzing, Dominik},
  volume = 	 {213},
  series = 	 {Proceedings of Machine Learning Research},
  month = 	 {11--14 Apr},
  publisher =    {PMLR},
  pdf = 	 {https://proceedings.mlr.press/v213/montagna23a/montagna23a.pdf},
  url = 	 {https://proceedings.mlr.press/v213/montagna23a.html},
  abstract = 	 {Causal discovery methods are intrinsically constrained by the set of assumptions needed to ensure structure identifiability. Moreover additional restrictions are often imposed in order to simplify the inference task: this is the case for the Gaussian noise assumption on additive non-linear models, which is common to many causal discovery approaches. In this paper we show the shortcomings of inference under this hypothesis, analyzing the risk of edge inversion under violation of Gaussianity of the noise terms. Then, we propose a novel method for inferring the topological ordering of the variables in the causal graph, from data generated according to an additive non-linear model with a generic noise distribution. This leads to NoGAM (Not only Gaussian Additive noise Models), a causal discovery algorithm with a minimal set of assumptions and state of the art performance, experimentally benchmarked on synthetic data.}
}