Metraipolis › archive › dc_ee4f377fec68
General Probabilities of Causation with Causal Knowledge — arXiv:2608.12657
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12657
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:17:17.365Z
- SHA-256 of the archived text
268a33dce3269db1188fbea1be2f3fcdb11e5d6fa5b0d301c0a4b5a872754e72- Stable URL of this page
https://metraipolis.com/documento/dc_ee4f377fec68
How to cite
General Probabilities of Causation with Causal Knowledge — arXiv:2608.12657 — arXiv (en), https://arxiv.org/abs/2608.12657 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ee4f377fec68 (Metraipolis archive dc_ee4f377fec68, sha256 268a33dce3269db1188fbea1be2f3fcdb11e5d6fa5b0d301c0a4b5a872754e72)
BibTeX
@misc{dcee4f377fec68,
title = {General Probabilities of Causation with Causal Knowledge — arXiv:2608.12657},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12657},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ee4f377fec68; sha256 268a33dce3269db1188fbea1be2f3fcdb11e5d6fa5b0d301c0a4b5a872754e72},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12657. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-14 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2608.12657 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T04:13:06.537Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).