We study probabilities of causation in nondeterministic causal models, where mechanisms may remain intrinsically stochastic even after all latent variables are fixed. Focusing on binary treatments and outcomes, we develop a generic identification program that represents observational and interventional data as moment constraints on latent stochastic mechanism types and computes minimal/maximal values of counterfactual quantities via constrained optimization. Within this framework, we derive sharp analytic bounds on the probabilities of causation under several assumptions tailored to nondeterministic models. Resulting identification regions are often more informative than those attainable under deterministic alternatives. We illustrate the practical relevance of these results in a case study on personalized treatment decisions and experiments on semi-synthetic datasets. Our results clarify how classical bounds relate to nondeterministic causal semantics, generalizing previous works and providing a unified route from qualitative structural restrictions to computable partial identification regions.
Figures & tables
Figure 1: DAG for the confounded model M . The dashed node is unobserved.
Figure 2: Modified DAG, replacing Y with potential outcomes (shaded) and introducing latent nodes (dashed) for treatment propensity A and stochastic response variables B,C .
Assumptions
P(B)
P(H)
λ=2
λ∗
Experimental data only
[0.28,0.49]
[0,0.21]
undecided
1.33
D , no restriction
[0.28,0.44]
[0,0.16]
undecided
1.75
D , s-monotonicity
[0.28,0.395]
[0,0.115]
treat
2.44
D , monotonicity
0.28
0
treat
∞
Table 1: Sharp bounds on the probabilities of benefit and harm in the example, the resulting decision under rule ( 1 ) with λ=2 , and the largest harm aversion λ∗ for which treatment is justified.
Figure 3: Semi-synthetic experiment. (a) Results with a variable (uniform) margin parameter ε on the adult dataset. (b) Results with variable soft exogeneity parameter δ on the JOBS II dataset.
Probabilities of causation are fundamental to individual-level explanation and decision making, yet they are inherently counterfactual and not point-identifiable from data in general. Existing bounds either disregard available covariates, require complete causal graphs, or rely on restrictive binary settings, limiting their practical use. In real-world applications, causal information is often partial but nontrivial. This paper proposes a general framework for bounding probabilities of causation using partial causal information. We show how the available structural or statistical information can be systematically incorporated as constraints in a optimization programming formulation, yielding tighter and formally valid bounds without full identifiability. This approach extends the applicability of probabilities of causation to realistic settings where causal knowledge is incomplete but informative.
Yuxuan Xie, Ang Li
University of Ottawa, Ontario, Canada · Department of Computer Science, Florida State University, FL, U.S.A.
Probabilities of causation (PoCs) have developed steadily, from the binary measures first introduced by Pearl to the non-binary setting recently studied by Shu et al. As the theory has matured, PoCs have found applications in a growing range of areas, including personalized medicine, marketing and legal attribution. Shu et al. proposed closed-form bounds for multi-valued treatments and outcomes and proved them valid, but left their sharpness in high dimensions open. We close this gap with a mathematical proof. We further show that \PNS, \PSub, \PRep and \PN are all special cases of a single, more general formula. Combined with their equivalence classes, this settles the question of sharp bounds for discrete PoCs from experimental and observational data: in every dimension, they are given in closed form by a single theorem.
Xin Shu, Ang Li
Department of Computer Science, Florida State University
Probabilities of causation (PoCs) characterize individual causal responses that cannot be directly observed and therefore generally require partial identification. Tian and Pearl first derived theoretically sharp bounds for binary PoCs, including the probability of necessity (PN), the probability of sufficiency (PS), and the probability of necessity and sufficiency (PNS). Mueller et al. subsequently tightened the bounds for binary PNS by incorporating causal information encoded in covariates and mediators. More recently, Li and Pearl, as well as Shu et al., extended PoCs to multivalued settings and derived corresponding theoretical bounds. These developments naturally raise the question of whether additional causal knowledge can further tighten the bounds in multivalued settings. This paper addresses this question by deriving tighter bounds for multivalued PoCs through the incorporation of causal information encoded in covariates and mediators. We illustrate the theoretical results with toy examples, while simulation studies further demonstrate that the proposed bounds are tighter than existing nonbinary bounds.
Xin Shu, Zhen Lei, Ang Li
Department of Computer Science, Florida State University