Distinguishability of causal structures under latent confounding and selection

• URL: http://arxiv.org/abs/2509.20433v1
• Date: Wed, 24 Sep 2025 18:00:22 GMT
• Title: Distinguishability of causal structures under latent confounding and selection
• Authors: Ryan Carey, Marina Maciel Ansanelli, Elie Wolfe, Robin J. Evans,
• Abstract summary: 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.
• Score: 5.4951298386957825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Statistical relationships in observed data can arise for several different reasons: the observed variables may be causally related, they may share a latent common cause, or there may be selection bias. Each of these scenarios can be modelled using different causal graphs. Not all such causal graphs, however, can be distinguished by experimental data. In this paper, we formulate the equivalence class of causal graphs as a novel graphical structure, the selected-marginalized directed graph (smDG). That is, 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. As a substitute for the more familiar d-separation criterion for DAGs, we provide an analogous sound and complete separation criterion in smDGs for conditional independence relative to passive observations. Finally, we provide a series of sufficient conditions under which two causal structures are indistinguishable when there is only access to passive observations.

Related papers

• Causal Graph Learning via Distributional Invariance of Cause-Effect Relationship [54.575090553659074]
  We develop an algorithm that efficiently uncovers causal relationships with quadratic complexity in the number of observational variables.<n>Our experiments on a varied benchmark of large-scale datasets show superior or equivalent performance compared to existing works.
  arXiv  Detail & Related papers  (2026-02-03T10:26:16Z)
• On the identifiability of causal graphs with multiple environments [0.5076419064097734]
  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.
  arXiv  Detail & Related papers  (2025-10-15T14:16:21Z)
• 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)
• 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)
• 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)
• Typing assumptions improve identification in causal discovery [123.06886784834471]
  Causal discovery from observational data is a challenging task to which an exact solution cannot always be identified. We propose a new set of assumptions that constrain possible causal relationships based on the nature of the variables.
  arXiv  Detail & Related papers  (2021-07-22T14:23:08Z)
• 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)
• CausalVAE: Structured Causal Disentanglement in Variational Autoencoder [52.139696854386976]
  The framework of variational autoencoder (VAE) is commonly used to disentangle independent factors from observations. We propose a new VAE based framework named CausalVAE, which includes a Causal Layer to transform independent factors into causal endogenous ones. Results show that the causal representations learned by CausalVAE are semantically interpretable, and their causal relationship as a Directed Acyclic Graph (DAG) is identified with good accuracy.
  arXiv  Detail & Related papers  (2020-04-18T20:09:34Z)

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.