arXiv AI

Graph Surgery and the Do-Operator: A Precise Correspondence for Acyclic Structural Causal Models

The paper establishes a precise mathematical link between graph surgery and the do‑operator in deterministic acyclic structural causal models. It shows that deleting arrows in a graph corresponds exactly to replacing the associated mechanisms with constants, proving that “Graph(F^\iota)=Surg(Graph(F),T_\iota)”. The authors further characterize when this equality holds for the full graph, define the intervened model, and demonstrate how sequential interventions combine, concluding that an outcome depends only on interventions at its actual dependency ancestors.

arXiv AI
Jul 16

Partially Observed Structural Causal Models

arXiv:2605. 03268v2 Announce Type: replace-cross Abstract: Here we introduce Partially Observed Structural Causal Models (POSCMs) as an extension of structural causal models (SCMs) to settings where upstream contexts co-determine both the interaction structure and downstream mechanisms on observed variables.

By Turan Orujlu, Jordan Matelsky, Martin V. Butz, Charley M. Wu, Konrad P. Kording
arXiv AI
Jun 24

Infinitesimal Causality

arXiv:2606. 24621v1 Announce Type: cross Abstract: This paper introduces a categorical account of infinitesimal causality in Frobenius Markov categories equipped with tangent-bundle semantics.

By Sridhar Mahadevan
arXiv AI
Jun 2

Causal Density Functions

arXiv:2606. 00754v1 Announce Type: cross Abstract: We introduce causal density functions: Radon-Nikodym derivatives that compare interventional laws to observational laws and therefore act as local density ratios for causal effects.

By Sridhar Mahadevan
arXiv Machine Learning
Aug 5

GoT-CD: Graph-of-Thoughts Causal Discovery and the Fragility of Post-hoc Path-Specific Fairness Audits

arXiv:2608. 02877v1 Announce Type: new Abstract: Causal discovery recovers directed structure from observational data and is increasingly used in clinical settings to support mechanism reasoning and fairness audits of predictive models.

By Nitish Nagesh, Elahe Khatibi, Thomas Dean Hughes, Mahdi Bagheri, Pratik Gajane, Amir M. Rahmani
arXiv AI
Aug 26

Partial Identification under Causal Orders by Linear Programming

The paper presents a method for partially identifying counterfactual queries without requiring a fully specified causal graph. By exploiting the topological ordering implied by the query itself, the authors transform the identification problem into a linear programming task, enabling bounds on arbitrary counterfactual and nested counterfactual queries. They demonstrate the tightness of these bounds and illustrate the approach on several case studies, showing its usefulness even when causal knowledge is incomplete.

By Eric Rossetto, Alessandro Antonucci
arXiv Machine Learning
Jun 30

Towards Complete Causal Explanation with Expert Knowledge

arXiv:2407. 07338v4 Announce Type: replace-cross Abstract: We study the problem of restricting a Markov equivalence class of maximal ancestral graphs (MAGs) to only those MAGs that contain certain edge marks, which we refer to as expert or orientation knowledge.

By Aparajithan Venkateswaran, Emilija Perkovi\'c
arXiv Machine Learning
Jul 2

Characterizing and Identifying Separable Graphical Models

arXiv:2607. 01057v1 Announce Type: cross Abstract: We study a broad class of graphical models whose independencies correspond to vertex separation in mixed graphs with directed, undirected, and bidirected edges, that are capable of encoding independence structures arising from feedback, latent and selection mechanisms.

By Christopher Meek, Kayvan Sadeghi