arXiv:2607. 09449v1 Announce Type: new Abstract: Bayesian causal discovery is widely used for its ability to quantify epistemic uncertainty over directed acyclic graphs (DAGs) through posterior inference.
By Debargha Ghosh, Silja Renooij, Anna Kononova
arXiv:2610.28134v1 Announce Type: cross
Abstract: Causal discovery with latent confounding is particularly challenging, but a common setting in real-world data. In this work, we focus on linear causa...
By Danru Xu, Aapo Hyv\"arinen, Sara Magliacane
arXiv:2608. 04930v1 Announce Type: cross Abstract: Bayesian causal discovery seeks to determine the posterior distribution of causal theories, which are interpreted as directed acyclic graphs (DAGs) that explain the observed data.
By Shrenik Zinage
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
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:2603.18404v3 Announce Type: replace
Abstract: Causal representation learning (CRL) aims to learn low-dimensional causal latent variables from high-dimensional observations. While identifiabilit...
By Bohan Wu, Julius von K\"ugelgen, David M. Blei
The paper reviews modern causal discovery techniques that go beyond conditional independence, highlighting how distributional properties, such as asymmetries, conditional moments, and environmental variation, can identify causal structure. It distinguishes between identification sources, statistical estimators, and computational implementations, and discusses challenges in the presence of latent confounding, feedback, and cyclic models. The authors also outline consistency, uncertainty quantification, and algorithmic guarantees, and provide guidance for comparing methods and a research agenda for future work.
By Yang Ni
arXiv:2607. 22934v1 Announce Type: cross Abstract: Learning causal graphs from interventional data is a challenging problem with broad applications.
By Yichen Gu, Yuxuan Song, Weizhou Qian, Yixin Wang, Joshua Welch
arXiv:2603. 02159v2 Announce Type: replace-cross Abstract: Instrumental variable (IV) and proximal causal learning (Proxy) methods are central frameworks for causal inference in the presence of unobserved confounding.
By Yuqi Zhang, Krikamol Muandet, Dino Sejdinovic, Edwin Fong, Siu Lun Chau
The article discusses recent advances in learning directed acyclic graphs (DAGs) from observational data, highlighting the challenges of enforcing acyclicity and dealing with latent confounding or heterogeneous noise. It reviews the evolution from combinatorial search methods to continuous, score‑based approaches that use smooth acyclicity constraints, and introduces concomitant DAG estimation techniques that jointly infer sparse causal structure and exogenous noise levels to improve robustness under heteroscedasticity and distribution shifts. The tutorial also outlines future research directions such as online, nonlinear, and neural causal discovery.
By Gonzalo Mateos, Samuel Rey, Hamed Ajorlou, Mariano Tepper
The paper evaluates four main approaches to scalable nonlinear causal discovery—differentiable, amortized, score‑matching, and combinatorial search—highlighting their distinct accuracy‑runtime trade‑offs. It introduces SPADE, a spline‑based score‑evaluation method that compiles and reuses sufficient statistics, reducing combinatorial search complexity from O(nd³) to O(nd²+d³). Empirical results show SPADE dramatically extends the scalability‑accuracy frontier, solving large‑scale problems with high structural accuracy on both synthetic and real‑world data.
By Hendrik Suhr, Sascha Xu, Jilles Vreeken
arXiv:2608. 12640v1 Announce Type: cross Abstract: Causal discovery aims to uncover the underlying causal relationships given data generated from a system.
By Cixuan Zhang, Guy Van den Broeck, Benjie Wang