Saved in:
Bibliographic Details
Main Author: Montagna, Francesco
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.13583
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913127898021888
author Montagna, Francesco
author_facet Montagna, Francesco
contents Causal discovery from i.i.d. observational data is known to be generally ill-posed. We demonstrate that if we have access to the distribution {induced} by a structural causal model, and additional data from (in the best case) \textit{only two} environments that sufficiently differ in the noise statistics, the unique causal graph is identifiable. Notably, this is the first result in the literature that guarantees the entire causal graph recovery with a constant number of environments and arbitrary nonlinear mechanisms. Our only constraint is the Gaussianity of the noise terms; however, we propose potential ways to relax this requirement. Of interest on its own, we expand on the well-known duality between independent component analysis (ICA) and causal discovery; recent advancements have shown that nonlinear ICA can be solved from multiple environments, at least as many as the number of sources: we show that the same can be achieved for causal discovery while having access to much less auxiliary information.
format Preprint
id arxiv_https___arxiv_org_abs_2510_13583
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On the Identifiability of Causal Graphs with the Invariance Principle
Montagna, Francesco
Machine Learning
Causal discovery from i.i.d. observational data is known to be generally ill-posed. We demonstrate that if we have access to the distribution {induced} by a structural causal model, and additional data from (in the best case) \textit{only two} environments that sufficiently differ in the noise statistics, the unique causal graph is identifiable. Notably, this is the first result in the literature that guarantees the entire causal graph recovery with a constant number of environments and arbitrary nonlinear mechanisms. Our only constraint is the Gaussianity of the noise terms; however, we propose potential ways to relax this requirement. Of interest on its own, we expand on the well-known duality between independent component analysis (ICA) and causal discovery; recent advancements have shown that nonlinear ICA can be solved from multiple environments, at least as many as the number of sources: we show that the same can be achieved for causal discovery while having access to much less auxiliary information.
title On the Identifiability of Causal Graphs with the Invariance Principle
topic Machine Learning
url https://arxiv.org/abs/2510.13583