Score matching enables causal discovery of nonlinear additive noise models

03/08/2022
by   Paul Rolland, et al.
2

This paper demonstrates how to recover causal graphs from the score of the data distribution in non-linear additive (Gaussian) noise models. Using score matching algorithms as a building block, we show how to design a new generation of scalable causal discovery methods. To showcase our approach, we also propose a new efficient method for approximating the score's Jacobian, enabling to recover the causal graph. Empirically, we find that the new algorithm, called SCORE, is competitive with state-of-the-art causal discovery methods while being significantly faster.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2011

Least-Squares Independence Regression for Non-Linear Causal Inference under Non-Gaussian Noise

The discovery of non-linear causal relationship under additive non-Gauss...
research
05/26/2023

Learning Causal Graphs via Monotone Triangular Transport Maps

We study the problem of causal structure learning from data using optima...
research
04/19/2019

Causal Discovery with General Non-Linear Relationships Using Non-Linear ICA

We consider the problem of inferring causal relationships between two or...
research
06/05/2021

On the Role of Entropy-based Loss for Learning Causal Structures with Continuous Optimization

Causal discovery from observational data is an important but challenging...
research
07/08/2018

A New Noise-Assistant LMS Algorithm for Preventing the Stalling Effect

In this paper, we introduce a new algorithm to deal with the stalling ef...
research
08/14/2023

OCDaf: Ordered Causal Discovery with Autoregressive Flows

We propose OCDaf, a novel order-based method for learning causal graphs ...
research
04/06/2023

Causal Discovery and Optimal Experimental Design for Genome-Scale Biological Network Recovery

Causal discovery of genome-scale networks is important for identifying p...

Please sign up or login with your details

Forgot password? Click here to reset