arXiv Machine Learning

Differentiable Causal Discovery for Singular Linear Models under Confounding

arXiv AI
Oct 1

Differentiable Structure Learning for Cyclic Linear Gaussian Models with Latent Confounders

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 Machine Learning
Oct 19

Causal Discovery beyond Conditional Independence: Identifiability, Algorithms, and Statistical Inference for Directed Acyclic and Cyclic Graphs

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 Statistics ML
Oct 9

Concomitant DAG Learning: On the Roles of Noise Adaptivity, Sparsity, and Non-negativity

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
arXiv AI
Oct 5

Mapping and Advancing the Scalability-Accuracy Frontier of Nonlinear Causal Discovery

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