Original title: A Computationally Feasible Framework for Causal Probabilistic Explanation
Rafal Urbaniak, Sam Witty, Daniel Waxman, Andy Zane +6 · September 2026
Figuring out which cause deserves credit or blame for an outcome is a big problem. Current tools have major flaws. One method, called actual causalityA theory that determines whether a specific event caused another in a given scenario by comparing what happened to what could have happened., gives rigorous answers. However, it only works on tiny toy models because checking every alternative scenario takes too much computing power. Other methods scale to large systems, but they ignore causal structure and can give misleading answers. To solve this, researchers built Probabilistic Causal Impact, or PCI. PCI treats explanation as an estimation problem within a probabilistic causal modelA mathematical representation of how variables influence each other, incorporating randomness to reflect real-world uncertainty.. It works by setting up candidate explanations, possible alternative values, and a scoring function, which computers can quickly approximate using random sampling. Tests show that PCI provides scalable, causally sound explanations across simple models, complex dynamic systems, and a real-world model trained on millions of datapoints.
Imagine you bake a cake and it comes out dry, but you changed multiple things like the oven temperature, sugar amount, and baking time. To figure out why, you might try baking again with just one change, but that takes time and you can't test every combination. In this paper, PCI uses math to quickly simulate all those possible changes and tells you which ingredient is most likely responsible, without redoing the cake each time.
Scientists, policymakers, and engineers can now reliably determine why outcomes happened and who is responsible, even in large complex systems. This matters because previous tools were either too slow for real-world data or gave misleading blame assignments.
The abstract does not state specific limitations, but it focuses on closing the gap between computationally infeasible principled methods and scalable methods that ignore causal structure. It does not claim to solve all explainability problems, only to provide a feasible approach for large-scale causal models.
Ask anything about this paper. Answers come from its abstract, and say so when the abstract doesn't cover your question.
A Computationally Feasible Framework for Causal Probabilistic Explanation — Rafal Urbaniak, Sam Witty, Daniel Waxman et al.
Abstract licence: CC0
Explanation generated by Synthesis from the abstract — it is not the original paper. This is a preprint, so it hasn't necessarily been peer reviewed.