General Probabilities of Causation with Causal Knowledge

• URL: http://arxiv.org/abs/2608.12657v1
• Date: Wed, 12 Aug 2026 23:40:17 GMT
• Title: General Probabilities of Causation with Causal Knowledge
• Abstract summary: Probabilities of causation (PoCs) characterize individual causal responses that cannot be directly observed.<n>This paper addresses the question of whether additional causal knowledge can further tighten the bounds in multivalued settings.<n>We show that the proposed bounds are tighter than existing nonbinary bounds.
• Score: 24.25148273833436
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Variational Inference for Evidential Deep Learning [69.9353638875714]
  We propose a mathematically principled framework, Variational Inference Evidential Deep Learning (VI-EDL)<n>VI-EDL achieves state-of-the-art performance in out-of-distribution detection, noise detection and autonomous driving scenario.
  arXiv  Detail & Related papers  (2026-05-26T02:32:59Z)
• Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers [65.58071581164043]
  We study robust regression under a contamination model in which covariates are clean while the responses may be corrupted in an adaptive manner.<n>We show that the additional information can be carefully exploited to construct an estimator that a better estimation rate than achieves that attainable under Huber contamination.<n>Despite the improvement over the Huber model from an information-theoretic perspective, we provide formal evidence that the problem exhibits strong information-computation gaps.
  arXiv  Detail & Related papers  (2026-04-05T19:07:24Z)
• Causal Identification from Counterfactual Data: Completeness and Bounding Results [54.147490305295456]
  We develop an algorithm for identifying counterfactual queries from an arbitrary set of Layer 3 distributions.<n>We establish the theoretical limit of which counterfactuals can be identified from physically realizable distributions.<n>We derive novel analytic bounds for such quantities using realizable counterfactual data.
  arXiv  Detail & Related papers  (2026-02-26T22:48:12Z)
• Operational Derivation of Born's Rule from Causal Consistency in Generalized Probabilistic Theories [0.0]
  We show that any admissible state-to-probability map must be affine under mixing.<n>We identify Born's rule as a causal fixed point among admissible probabilistic laws.
  arXiv  Detail & Related papers  (2025-12-14T10:50:42Z)
• Identification of Probabilities of Causation: A Complete Characterization [14.18654714001098]
  We propose a complete set of representative probabilities of causation and prove that they are sufficient to characterize all possible probabilities of causation within the framework of Structural Causal Models (SCMs)<n>We then formally derive tight bounds for these representative quantities using formal mathematical proofs.
  arXiv  Detail & Related papers  (2025-05-21T08:50:12Z)
• The boundary of Kirkwood-Dirac quasiprobability [0.759660604072964]
  The Kirkwood-Dirac quasiprobability describes measurement statistics of joint quantum observables.<n>We introduce the postquantum quasiprobability under mild assumptions to provide an outer boundary for KD quasiprobability.<n>Surprisingly, we are able to derive some nontrivial bounds valid for both classical probability and KD quasiprobability.
  arXiv  Detail & Related papers  (2025-04-12T14:23:36Z)
• New Rules for Causal Identification with Background Knowledge [59.733125324672656]
  We propose two novel rules for incorporating BK, which offer a new perspective to the open problem. We show that these rules are applicable in some typical causality tasks, such as determining the set of possible causal effects with observational data.
  arXiv  Detail & Related papers  (2024-07-21T20:21:21Z)
• Bounding probabilities of causation through the causal marginal problem [12.542533707005092]
  Probabilities of causation play a fundamental role in decision making in law, health care and public policy. In many clinical trials and public policy evaluation cases, there exist independent datasets that examine the effect of a different treatment each on the same outcome variable. Here, we outline how to significantly tighten existing bounds on the probabilities of causation, by imposing counterfactual consistency between SCMs constructed from such independent datasets.
  arXiv  Detail & Related papers  (2023-04-04T12:16:38Z)
• Probabilities of Causation with Nonbinary Treatment and Effect [20.750773939911685]
  Tian and Pearl derived sharp bounds for the probability of necessity and sufficiency. We provide theoretical bounds for all types of probabilities of causation to multivalued treatments and effects.
  arXiv  Detail & Related papers  (2022-08-19T23:54:47Z)
• A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits [91.3755431537592]
  This paper unifies the analysis of risk-averse Thompson sampling algorithms for the multi-armed bandit problem. Using the contraction principle in the theory of large deviations, we prove novel concentration bounds for continuous risk functionals. We show that a wide class of risk functionals as well as "nice" functions of them satisfy the continuity condition.
  arXiv  Detail & Related papers  (2021-08-25T17:09:01Z)
• R\'enyi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations [91.3755431537592]
  We investigate quantum R'enyi entropic quantities, specifically those derived from'sandwiched' divergence. We present R'enyi mutual information decomposition rules, a new approach to the R'enyi conditional entropy tripartite chain rules and a more general bipartite comparison.
  arXiv  Detail & Related papers  (2021-06-19T04:06:23Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.