Differentiable Causal Search

Actual causality–identifying the causes of particular events–is formalised by the Halpern–Pearl (HP) definitions via counterfactual reasoning over structural causal models. Computing HP causes requires solving a combinatorial optimisation problem that is, depending on the variant, \(D^P_1\)-complete or worse. We propose a differentiable approximation of HP causality that leverages the robustness semantics of logical specifications and additive intervention relaxations. Specifically, we replace discrete satisfiability constraints with continuous robustness scores, and model interventions as soft variable shifts rather than hard graph surgeries. This, along with a sparsity relaxation, allows for using continuous optimisation techniques such as gradient descent. Experiments on synthetic graphs show that our method, on average, approximates the true causes with a $\pm$5 % error margin, while achieving at least a 60$\times$ speedup. The framework also supports fine-grained control over additional causal properties such as the desired counterfactual robustness.

Authors

• Kaveh Aryan
• Hana Chockler
• Mohammad Reza Mousavi

Keywords

No keywords are indexed for this paper.