← Back to all news
arXiv Machine Learning By Gaetano Tedesco (University of Amsterdam), Alex Markham (University of Copenhagen)

Score-Based Learning of Cluster DAGs from Interventions

Read the original on arXiv Machine Learning →

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.

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.

Related stories

arXiv Machine Learning
Aug 27

Cluster-Dags as Powerful Background Knowledge For Causal Discovery

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.

By Jan Marco Ruiz de Vargas, Kirtan Padh, Niki Kilbertus
More like this →
arXiv Statistics ML
6d ago

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
efficiency
More like this →
arXiv Machine Learning
Jul 10

Structure Learning on Clustered Data

arXiv:2607. 08238v1 Announce Type: new Abstract: Recent algorithmic advances have made directed acyclic graph (DAG) structure learning scalable for causal discovery.

By Ryan Thompson, Matt P. Wand, Veerabhadran Baladandayuthapani
More like this →