Differentiable Cyclic Causal Discovery Under Unmeasured Confounders
- URL: http://arxiv.org/abs/2508.08450v1
- Date: Mon, 11 Aug 2025 20:13:34 GMT
- Title: Differentiable Cyclic Causal Discovery Under Unmeasured Confounders
- Authors: Muralikrishnna G. Sethuraman, Faramarz Fekri,
- Abstract summary: DCCD-CONF is a novel framework for differentiable learning of nonlinear cyclic causal graphs in the presence of unmeasured confounders.<n>We show that DCCD-CONF outperforms state-of-the-art methods in both causal graph recovery and confounder identification.
- Score: 11.594415886406553
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Understanding causal relationships between variables is fundamental across scientific disciplines. Most causal discovery algorithms rely on two key assumptions: (i) all variables are observed, and (ii) the underlying causal graph is acyclic. While these assumptions simplify theoretical analysis, they are often violated in real-world systems, such as biological networks. Existing methods that account for confounders either assume linearity or struggle with scalability. To address these limitations, we propose DCCD-CONF, a novel framework for differentiable learning of nonlinear cyclic causal graphs in the presence of unmeasured confounders using interventional data. Our approach alternates between optimizing the graph structure and estimating the confounder distribution by maximizing the log-likelihood of the data. Through experiments on synthetic data and real-world gene perturbation datasets, we show that DCCD-CONF outperforms state-of-the-art methods in both causal graph recovery and confounder identification. Additionally, we also provide consistency guarantees for our framework, reinforcing its theoretical soundness.
Related papers
- Moment Matters: Mean and Variance Causal Graph Discovery from Heteroscedastic Observational Data [2.436681150766912]
Heteroscedasticity -- where the variance of a variable changes with other variables -- is pervasive in real data.<n>Standard causal discovery does not reveal which causes act on the mean versus the variance, as it returns a single moment-agnostic graph.<n>We propose a Bayesian, moment-driven causal discovery framework that infers separate textitmean and textit variance causal graphs from observational heteroscedastic data.
arXiv Detail & Related papers (2026-02-27T02:13:03Z) - Coarsening Causal DAG Models [0.0]
We propose an efficient, provably consistent algorithm for learning abstract causal graphs from interventional data with unknown intervention targets.<n>As proof of concept, we apply our algorithm on synthetic and real datasets with known ground truths.
arXiv Detail & Related papers (2026-01-15T15:56:20Z) - Causal Discovery for Linear DAGs with Dependent Latent Variables via Higher-order Cumulants [7.808674222118538]
Existing methods assume mutually independent latent confounders or cannot properly handle models with causal relationships among observed variables.<n>We propose a novel algorithm that identifies causal DAGs in LvLiNGAM, allowing causal structures among latent variables, among observed variables, and between the two.
arXiv Detail & Related papers (2025-10-16T15:15:20Z) - Retrieving Classes of Causal Orders with Inconsistent Knowledge Bases [0.8192907805418583]
Large Language Models (LLMs) have emerged as a promising alternative for extracting causal knowledge from text-based metadata.<n>LLMs tend to be unreliable and prone to hallucinations, necessitating strategies that account for their limitations.<n>We present a new method to derive a class of acyclic tournaments, which represent plausible causal orders.
arXiv Detail & Related papers (2024-12-18T16:37:51Z) - Differentiable Causal Discovery For Latent Hierarchical Causal Models [19.373348700715578]
We present new theoretical results on the identifiability of nonlinear latent hierarchical causal models.<n>We develop a novel differentiable causal discovery algorithm that efficiently estimates the structure of such models.
arXiv Detail & Related papers (2024-11-29T09:08:20Z) - Causal Temporal Regime Structure Learning [49.77103348208835]
We present CASTOR, a novel method that concurrently learns the Directed Acyclic Graph (DAG) for each regime.<n>We establish the identifiability of the regimes and DAGs within our framework.<n>Experiments show that CASTOR consistently outperforms existing causal discovery models.
arXiv Detail & Related papers (2023-11-02T17:26:49Z) - 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) - NODAGS-Flow: Nonlinear Cyclic Causal Structure Learning [8.20217860574125]
We propose a novel framework for learning nonlinear cyclic causal models from interventional data, called NODAGS-Flow.
We show significant performance improvements with our approach compared to state-of-the-art methods with respect to structure recovery and predictive performance.
arXiv Detail & Related papers (2023-01-04T23:28:18Z) - Learning latent causal relationships in multiple time series [0.0]
In many systems, the causal relations are embedded in a latent space that is expressed in the observed data as a linear mixture.
A technique for blindly identifying the latent sources is presented.
The proposed technique is unsupervised and can be readily applied to any multiple time series to shed light on the causal relationships underlying the data.
arXiv Detail & Related papers (2022-03-21T00:20:06Z) - BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG)
Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data.
We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
arXiv Detail & Related papers (2021-12-06T03:35:21Z) - Learning Neural Causal Models with Active Interventions [83.44636110899742]
We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process.
Our method significantly reduces the required number of interactions compared with random intervention targeting.
We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
arXiv Detail & Related papers (2021-09-06T13:10:37Z) - Variational Causal Networks: Approximate Bayesian Inference over Causal
Structures [132.74509389517203]
We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs.
In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
arXiv Detail & Related papers (2021-06-14T17:52:49Z) - 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) - Causal discovery of linear non-Gaussian acyclic models in the presence
of latent confounders [6.1221613913018675]
This paper proposes a causal functional model-based method called repetitive causal discovery (RCD) to discover the causal structure of observed variables affected by latent confounders.
RCD repeats inferring the causal directions between a small number of observed variables and determines whether the relationships are affected by latent confounders.
arXiv Detail & Related papers (2020-01-13T12:55:47Z)
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.