On the identifiability of causal graphs with multiple environments

Francesco Montagna
10/15/2025
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

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 of a structural causal model, and additional data from 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{montagna2025identifiability,
  title  = {On the identifiability of causal graphs with multiple environments},
  author = {Francesco Montagna},
  year   = {2025},
  eprint = {2510.13583},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.13583v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.13583.svg)](https://codeofpaper.com/paper/2510.13583)

Discussion