Recovering the directed acyclic graph (DAG) of a structural equation model (SEM) from observational data is a central problem in causal discovery. The iterative gradient descent and per-problem hyperp...
arXiv:2609.30643v1 Announce Type: new
Abstract: We consider the problem of learning the underlying causal directed acyclic graph (DAG) structure corresponding to a structural equation model (SEM) wit...
By Anamitra Chaudhuri, Anirban Bhattacharya, Yang Ni
arXiv:2601.01368v2 Announce Type: replace
Abstract: Score-based causal discovery in the presence of unobserved confounders requires both a consistent scoring criterion and an efficient search over gr...
By Mujin Zhou, Ignavier Ng, Junzhe Zhang
The paper introduces a method for learning causal structures in linear Gaussian models that may contain directed cycles and an unknown number of latent confounders, bounded by a maximum. It derives the covariance of observed variables, defines marginal quasi-equivalence to identify when different models produce the same observational distributions, and formulates structure learning as a minimization of Gaussian negative log-likelihood with a complexity penalty counting edges and latent variables. Using Bernoulli gates to parameterize edge and latent inclusion, the authors obtain a closed‑form differentiable objective whose expected value shares the same global optimum as the discrete problem, and demonstrate experimentally that this approach yields lower recovery error than prior methods.
By Sadegh Khorasani, Ali Najar, Saber Salehkaleybar, Negar Kiyavash
arXiv:2609. 18535v1 Announce Type: new Abstract: Causal discovery aims to recover causal relationships from observed data.
By Weijian Yu, Jean Honorio
arXiv:2607. 05984v1 Announce Type: new Abstract: Recovering the exact directed acyclic graph (DAG) in linear non-Gaussian acyclic models with latent confounders (LvLiNGAM) remains a challenging problem.
By Ming Cai, Hisayuki Hara