arXiv Machine Learning By Jani Nyk\"anen, Otto Tabell, Santtu Tikka, Juha Karvanen

Invariance of Clustering Operations in Causal Effect Identification

Read the original on arXiv Machine Learning →

The paper studies how clustering variables in causal graphs can simplify inference but may also distort causal relations. It defines an "identification invariant" clustering operation—one that preserves both identifiability and nonidentifiability of causal effects—and presents a broad class of such operations based on conditions involving the c‑components of the original graph. The authors illustrate the practical application of these results in real‑world settings.

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 AI
Oct 12

Causal Effect Identifiability in Causal Abstractions: A Strict Hierarchy of Criteria

The paper investigates how to determine causal effects when only partial causal information is available, using collections of compatible causal graphs instead of a single fully specified graph. It introduces several formal notions of identifiability for these graph collections and arranges them into a strict hierarchy that clarifies their interrelations. The authors show that a causal effect can be identified across a set of graphs even when no single causal derivation applies uniformly to all of them, thereby exposing gaps and ambiguities in prior work.

By Cl\'ement Yvernes, Marianne Clausel, Emilie Devijver, Eric Gaussier
arXiv Machine Learning
Jun 18

Clustering and Pruning in Causal Data Fusion

arXiv:2505. 15215v3 Announce Type: replace-cross Abstract: Data fusion, the process of combining observational and experimental data, can enable the identification of causal effects that would otherwise remain non-identifiable.

By Otto Tabell, Santtu Tikka, Juha Karvanen
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