On the identifiability of causal graphs with multiple environments

• URL: http://arxiv.org/abs/2510.13583v1
• Date: Wed, 15 Oct 2025 14:16:21 GMT
• Title: On the identifiability of causal graphs with multiple environments
• Authors: Francesco Montagna,
• Abstract summary: Causal discovery from i.i.d. observational data is generally ill-posed.<n>We demonstrate that if we have access to a structural causal model, and additional data from only two environments that sufficiently differ in the noise statistics, the unique causal graph is identifiable.<n>This is the first result that guarantees the entire causal graph recovery with a constant number of environments and arbitrary nonlinear mechanisms.
• Score: 0.5076419064097734
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Sample Complexity of Causal Identification with Temporal Heterogeneity [6.5822033630228916]
  We show that temporal structure is shown to effectively substitute for missing environmental diversity.<n>This work shifts the focus from whether causal structure is identifiable to whether it is statistically recoverable in practice.
  arXiv  Detail & Related papers  (2026-02-06T17:44:00Z)
• Distinguishability of causal structures under latent confounding and selection [5.4951298386957825]
  We formulate the equivalence class of causal graphs as a novel graphical structure, the selected-marginalized directed graph (smDG)<n>We show that two directed acyclic graphs with latent and selected vertices have the same smDG if and only if they are indistinguishable, even when allowing for arbitrary interventions on the observed variables.
  arXiv  Detail & Related papers  (2025-09-24T18:00:22Z)
• Score matching through the roof: linear, nonlinear, and latent variables causal discovery [18.46845413928147]
  Causal discovery from observational data holds great promise.<n>Existing methods rely on strong assumptions about the underlying causal structure.<n>We propose a flexible algorithm suited for causal discovery on linear, nonlinear, and latent variable models.
  arXiv  Detail & Related papers  (2024-07-26T14:09:06Z)
• Causal Discovery under Latent Class Confounding [2.1749194587826026]
  We show that globally confounded causal structures can still be identifiable with arbitrary structural equations and noise functions. We demonstrate that globally confounded causal structures can still be identifiable with arbitrary structural equations and noise functions.
  arXiv  Detail & Related papers  (2023-11-13T16:35:34Z)
• Identifiable Latent Polynomial Causal Models Through the Lens of Change [82.14087963690561]
  Causal representation learning aims to unveil latent high-level causal representations from observed low-level data.<n>One of its primary tasks is to provide reliable assurance of identifying these latent causal models, known as identifiability.
  arXiv  Detail & Related papers  (2023-10-24T07:46:10Z)
• Structural restrictions in local causal discovery: identifying direct causes of a target variable [0.9208007322096533]
  Learning a set of direct causes of a target variable from an observational joint distribution is a fundamental problem in science.<n>Here, we are only interested in identifying the direct causes of one target variable, not the full DAG.<n>This allows us to relax the identifiability assumptions and develop possibly faster and more robust algorithms.
  arXiv  Detail & Related papers  (2023-07-29T18:31:35Z)
• Learning nonparametric latent causal graphs with unknown interventions [18.6470340274888]
  We establish conditions under which latent causal graphs are nonparametrically identifiable. We do not assume the number of hidden variables is known, and we show that at most one unknown intervention per hidden variable is needed.
  arXiv  Detail & Related papers  (2023-06-05T14:06:35Z)
• Nonparametric Identifiability of Causal Representations from Unknown Interventions [63.1354734978244]
  We study causal representation learning, the task of inferring latent causal variables and their causal relations from mixtures of the variables. Our goal is to identify both the ground truth latents and their causal graph up to a set of ambiguities which we show to be irresolvable from interventional data.
  arXiv  Detail & Related papers  (2023-06-01T10:51:58Z)
• Active Bayesian Causal Inference [72.70593653185078]
  We propose Active Bayesian Causal Inference (ABCI), a fully-Bayesian active learning framework for integrated causal discovery and reasoning. ABCI jointly infers a posterior over causal models and queries of interest. We show that our approach is more data-efficient than several baselines that only focus on learning the full causal graph.
  arXiv  Detail & Related papers  (2022-06-04T22:38:57Z)
• Effect Identification in Cluster Causal Diagrams [51.42809552422494]
  We introduce a new type of graphical model called cluster causal diagrams (for short, C-DAGs) C-DAGs allow for the partial specification of relationships among variables based on limited prior knowledge. We develop the foundations and machinery for valid causal inferences over C-DAGs.
  arXiv  Detail & Related papers  (2022-02-22T21:27:31Z)
• Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding [101.35070661471124]
  We show that unobserved confounding leaves a characteristic footprint in the observed data distribution that allows for disentangling spurious and causal effects. We propose an adjusted score-based causal discovery algorithm that may be implemented with general-purpose solvers and scales to high-dimensional problems.
  arXiv  Detail & Related papers  (2021-03-28T11:07:59Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.