Differentiable Cyclic Causal Discovery Under Unmeasured Confounders
This addresses a fundamental limitation in causal discovery for domains like biology, where cyclic relationships and unmeasured confounders are common, though it is an incremental improvement over existing methods.
The paper tackled the problem of learning nonlinear cyclic causal graphs with unmeasured confounders, proposing DCCD-CONF, which outperformed state-of-the-art methods in causal graph recovery and confounder identification on synthetic and real-world datasets.
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.