Score-Based Learning of Cluster DAGs from Interventions
summary
The gist
The gist The score-based method coarse introduces a first score-based method for learning an interventional coarsening from heterogeneous data, which merges variables with equal intervention
In short
The paper introduces COARSE, a score-based method to learn an interventional coarsening from heterogeneous data. It merges variables with identical intervention signatures and uses marginal shifts to identify clusters and their causal order. This approach replaces constraint-based edge recovery with a faster, single local search per cluster.
Key concepts
- Interventional Coarsening (GE)
- This is the goal: creating a smaller DAG where nodes are groups of original variables that cannot be distinguished by interventions. Variables sharing the same intervention signature are merged into one node in this coarse DAG.
- Intervention Signature ($\sigma(v)$)
- The signature of a variable is defined by which environments cause its marginal distribution to shift. If two variables have the same set of environments that change their marginals, they share the same signature and should be grouped together.
- Pooled BIC Score
- This score is used to determine the best edges between clusters. It combines individual BIC scores for each cluster, factoring in how many environments affect each cluster, allowing for a single local search per cluster instead of complex constraint-based searches.
Terminology used across episodes
This episode discusses
- Score-Based Learning of Cluster DAGs from Interventions · Paper Radio
- Approximate Causal Abstraction
- Structural Causal Bottleneck Models
- Visual Causal Feature Learning
- I-FLOP: Fast Learning of Order and Parents from Interventional Data · Paper Radio
- Large-Sample Learning of Bayesian Networks is NP-Hard
- Causal Abstraction Learning based on the Semantic Embedding Principle
- Estimating a Causal Order among Groups of Variables in Linear Models
- Distributionally Robust Causal Abstractions
- Characterization and Greedy Learning of Gaussian Structural Causal Models under Unknown Interventions
- Causal inference using the algorithmic Markov condition
- GroupLiNGAM: Linear non-Gaussian acyclic models for sets of variables
- Greedy Relaxations of the Sparsest Permutation Algorithm
- Coarsening Causal DAG Models
- Coarsening Linear Non-Gaussian Causal Models with Cycles
- Formally Justifying MDL-based Inference of Cause and Effect
- Causal Abstraction with Soft Interventions · Paper Radio
- Standardizing Structural Causal Models
- Causal inference using invariant prediction: identification and confidence intervals
- Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Game
- Causal Consistency of Structural Equation Models
The paper
Score-Based Learning of Cluster DAGs from Interventions · Read on arXiv
Informatics Institute, University of Amsterdam · Department of Mathematical Sciences, University of Copenhagen
Graphical approaches to causal abstraction transform a low-level causal directed acyclic graph (DAG) over many measured variables into a smaller, high-level DAG whose nodes cluster the original variables and whose edges summarize the causal relations between clusters. Such cluster DAGs are easier to interpret, but learning them requires finding the clusters and recovering the edges between them. Madaleno et al. (2026) learn the interventional coarsening (the cluster DAG that merges variables the interventions cannot distinguish) in two constraint-based phases: first the clusters, then the edges. We introduce COARSE, the first score-based method for this task: it keeps the two-phase structure but, under linear Gaussian assumptions, swaps the constraint-based edge phase for a score-based one. We show that the interventions themselves identify a causal order over the clusters, and learning the edges reduces to a single local search per cluster under a cluster-level BIC score. We prove that the procedure runs in polynomial time and, provided the variables affected by each intervention are correctly identified, that it is consistent. On synthetic and real-world interventional data, COARSE matches state-of-the-art edge recovery given enough samples, with an edge phase up to two orders of magnitude faster, including on dense graphs with hundreds of nodes.
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: I'm Tom, and with me are Jane, Lu, senior AI researcher at Tsinghua, Meng, lead engineer at a mysterious AI startup and Lalam, the in-house Large Language Model.
Jane: Today's paper: "Score-Based Learning of Cluster DAGs from Interventions".
Tom: The gist The score-based method coarse introduces a first score-based method for learning an interventional coarsening from heterogeneous data,
Jane: First, who's behind it and why it matters.
Paper summary: Jane: So looking at "Score-Based Learning of Cluster DAGs from Interventions," what's the big picture here for causal modeling? The authors are essentially proposing a new way to learn that coarse structure without relying on the traditional constraint-based methods that have those reliability issues >
Tom: They’re taking the two-phase approach—clusters first, then edges—but they’re replacing the edge recovery with something score-based, which is much more robust when you can assume linear Gaussian conditions hold >
Lu: I think this shifts the focus from brute-force testing to using data summaries. The interventions give you a causal order over the blocks, and then a simple score comparison lets you find those edges in a single local search per cluster >
Meng: From an engineering standpoint, that makes sense because we're talking about polynomial time complexity, and they prove consistency if our initial identification of which variables are affected by the intervention is correct >
Lalam: And as an AI, I see this as a way to make causal abstraction more scalable for complex systems. If we can do this faster and more reliably with heterogeneous data, it could help us build better cultural models or whatever we're modeling >
Jane: It really seems like they’ve managed to handle both the unknown macrovariables and the out-of-reach fine DAG simultaneously when heterogeneity is available >
Tom: The authors are showing that by using the intervention signatures to define what variables can be merged, you can read the grouping and causal order off those shifts alone, leaving only a small skeleton search for the edges >
Conclusion: Tom: So, we’re wrapping up this look at "Score-Based Learning of Cluster DAGs from Interventions." Basically, these authors are showing how to get a smaller, high-level map of a huge causal network by just looking at how things change when you intervene in them.
Jane: Right. They take all those messy variables and group them into clusters that behave similarly under intervention signatures—that’s the core idea here.
Lu: What’s really interesting is they keep the two-phase structure, but instead of using some hard-to-find constraint testing for the edges, they use a score comparison method.
Meng: So if we think about this practically, it means we don't have to run these super slow tests every single time we want to find those connections between the clusters.
Lalam: From my perspective on how models learn structure, this is significant because it suggests that grouping variables based on intervention effects alone can be a very powerful and efficient way to build a model skeleton.
Tom: Exactly. The paper proves that this whole procedure runs in polynomial time, which is huge for real-world data where things get really big fast. They show it’s consistent too, meaning if you test the variables right, you get the right result in the long run.
Jane: It really boils down to this: interventions don't just tell us *what* we can group together; they actually tell us the causal order between those groups as well.
Lu: And they show that once you have that order fixed, learning the final connections between the clusters becomes a much simpler task—just one local search per cluster using some pooled score.
Meng: That speed improvement in finding edges is what makes this method practical for scaling up to hundreds of nodes in dense graphs. It’s not just theoretically sound; they tested it on real interventional data and it matched the best current edge recovery methods.
Tom: It sounds like the main implication is that we can tackle those massive, out-of-reach fine DAG problems without getting completely bogged down by impossible computational searches.
Jane: So what this means for us looking at complex systems, whether it’s biology or economics, is that if we have intervention data but don't know the whole graph structure, we can start building a simplified map much faster.
Lu: It opens up a new way to handle heterogeneity—where variables aren't all treated equally—by using those signatures as the fundamental organizing principle.
Meng: It’s promising for any engineer who is trying to build scalable causal models where the underlying structure is too complex to fully map out at once. We need to see how this fits into our existing pipelines.
Tom: The next step, of course, is seeing how this translates from theory into a working system that can handle the messy details of actual real-world measurements.
More episodes
- 2610.11038-Decision-Sufficient Posterior Approximation
- 2610.11082-A General (sqrt T gamma T) Lower Bound for Kernel Bandits
- 2610.11139-Accelerating Non-Smooth and Heavy-Tailed Sampling
- 2610.11145-Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
- 2610.11226-When Lower Reconstruction Loss Hurts: Distributionally Robust Refinement for Low-Bit LLM Quantization
- 2610.11266-Regularized Small Area Estimation with Graph Laplacian Benchmarking priors
- 2610.11388-Sequential Conditional Independence Testing with Machine Learning Models
- 2610.11475-Rare Gate Disagreements Can Limit Plasticity: When Gradient Flow Mispredicts Finite-Batch SGD
- 2610.11407-Beyond Distributional Fidelity: Causal-Penalized Diffusion for Synthetic Tabular Data
- 2610.11459-Feature Space Adaptation for Effortless Gaussian Process Flows