Proceedings

Identification of Probabilities of Causation: From Recursive to Closed-Form Bounds

Xin Shu, Shuai Wang, Ang Li

Download BibTeX Cite

Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 4063-4070.

https://doi.org/10.24963/ijcai.2026/452

Keywords

  • Uncertainty in AI: Causality, structural causal models and causal inference
  • Knowledge Representation and Reasoning: Causality
  • Uncertainty in AI: Graphical models

Abstract

Probabilities of causation (PoCs) are fundamental quantities for counterfactual analysis and personalized decision making. However, existing analytical results are largely confined to binary settings. This paper extends PoCs to multi-valued treatments and outcomes by deriving closed form bounds for a representative family of discrete PoCs within Structural Causal Models, using standard experimental and observational distributions. We introduce the notion of equivalence classes of PoCs, which reduces arbitrary discrete PoCs to this family, and establish a replaceability principle that transfers bounds across value permutations. For the resulting bounds, we prove soundness in all dimensions and empirically verify tightness in low dimensional cases via Balke's linear programming method; we further conjecture that this tightness extends to all dimensions. Simulations indicate that our closed form bounds consistently tighten recent recursive bounds while remaining simpler to compute. Finally, we illustrate the practical relevance of our results through toy examples.

Xin Shu, Shuai Wang, and Ang Li. 2026. Identification of Probabilities of Causation: From Recursive to Closed-Form Bounds. In Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26. IJCAI, 4063–4070. https://doi.org/10.24963/ijcai.2026/452
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards