arXiv Machine Learning By Jan Marco Ruiz de Vargas, Kirtan Padh, Niki Kilbertus

Cluster-Dags as Powerful Background Knowledge For Causal Discovery

Read the original on arXiv Machine Learning →

The paper introduces Cluster-DAGs as a flexible prior knowledge framework to improve causal discovery. It presents two modified constraint‑based algorithms, Cluster‑PC and Cluster‑FCI, tailored for fully and partially observed data. Experiments on simulated data show that these methods outperform baseline algorithms that lack prior knowledge.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 14

DAG-FM: A Foundation Model for Causal Discovery under Heterogeneous Causal Mechanisms

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).

By Yikang Chen, Zhengkang Guan, Haoyuan Qian, Peng Cui, Yi Yang, Kun Kuang
arXiv Machine Learning
Sep 11

CausalArena: Benchmarking Causal Discovery in the Foundation Model Era

CausalArena is a new benchmark designed to evaluate causal discovery methods in the era of foundation models. It unifies synthetic structural causal models (SCMs), semantically grounded SCMs, and formula‑grounded SCMs, while also including real‑world datasets for external validation. Experiments show that performance rankings vary widely across different SCM families and protocols, indicating that strong results on one benchmark do not necessarily transfer to others.

By Zi-Rong Li, Si-Yang Liu, Tian-Zuo Wang, Han-Jia Ye
arXiv Machine Learning
Oct 9

Score-Based Learning of Cluster DAGs from Interventions

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.

By Gaetano Tedesco (University of Amsterdam), Alex Markham (University of Copenhagen)
arXiv AI
Jul 14

CDFM: Towards a General-Purpose Causal Discovery Foundation Model

arXiv:2607. 11508v1 Announce Type: cross Abstract: Causal discovery, the process of recovering underlying causal structures from observational data, is a fundamental pursuit across scientific disciplines.

By Jie Qiao, Ruichu Cai, Zijian Li, Weilin Chen, Pengfei Hua, Boyan Xu, Zhengming Chen, Zhifeng Hao, Peng Cui