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.
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...
arXiv:2607. 11510v1 Announce Type: new Abstract: Causal discovery from observational tabular data remains fundamentally challenging, primarily due to the heterogeneity of underlying causal mechanisms and the high-dimensional combinatorial search space of Directed Acyclic Graphs (DAGs).
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.
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.
Recovering the exact directed acyclic graph (DAG) in linear non-Gaussian acyclic models with latent confounders (LvLiNGAM) remains a challenging problem. Although LvLiNGAM is identifiable only up to an observational equivalence class, each equivalence class is characterized by a unique sparsest DAG.
The paper addresses causal discovery in Directed Acyclic Graphs where nodes are either ordinal (modeled with an ordered logit) or follow a one‑parameter exponential family distribution. It proves that the direction of edges between such nodes is identifiable for generic parameter values, extending prior Ordinal‑Poisson results. The authors also propose a score‑based exhaustive search and a masked continuous optimization method using DAGMA, and demonstrate through simulations that these approaches recover orientations that are otherwise unidentifiable under classical structural equation models.
The paper introduces COARSE, a score‑based method for learning cluster directed acyclic graphs (DAGs) from interventional data. COARSE retains the two‑phase structure of prior constraint‑based approaches—first identifying clusters, then edges—but replaces the edge‑learning phase with a score‑based local search under a cluster‑level BIC score, assuming linear Gaussian relationships. The authors prove polynomial‑time complexity and consistency (given correct intervention targets) and demonstrate that COARSE achieves comparable edge recovery to state‑of‑the‑art methods while being up to two orders of magnitude faster, even on dense graphs with hundreds of nodes.
arXiv:2609. 18535v1 Announce Type: new Abstract: Causal discovery aims to recover causal relationships from observed data.
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...
arXiv:2609.23535v1 Announce Type: new Abstract: Causal discovery from observational data is a fundamental yet challenging task in scientific research. While existing approaches are primarily based on...
arXiv:2606. 06440v1 Announce Type: new Abstract: Data-driven causal relationship identification is pertinent to advancing understanding of complex systems both within and beyond science.
arXiv:2608. 03868v1 Announce Type: cross Abstract: Causal Discovery (CD) from observational data faces two fundamental challenges.