arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.08304cs.AI
收藏

反事实界限的高效计算

Efficient Computation of Counterfactual Bounds

IDSIA(IDSIA研究所);University of Almería(阿尔梅里亚大学)

Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti

AI总结:

本文研究如何从结构因果模型和内部节点数据中高效计算部分可识别反事实查询的界限,提出因果EM近似方案,并通过合成基准和姑息治疗案例验证其准确性与实用性。

摘要:

我们假设给定离散变量上的结构方程,这些方程诱导出一个有向无环图,即一个结构因果模型,同时给出其内部节点的数据。我们希望回答的问题是:如何从这样的输入中计算部分可识别反事实查询的界限。我们首先给出从结构因果模型到可信网络的映射。这使我们能够在结构因果模型的一个子类上,通过可信网络算法计算精确的反事实界限。一般来说,精确计算将是低效的,因为正如我们所证明的,因果推断即使在多树(polytrees)上也是 NP 难的。因此,我们转而通过一种因果 EM 方案来求解近似界限。我们通过提供关于近似质量的可信区间来评估其准确性;我们通过一个合成基准表明,该 EM 方案在相当多的运行次数中能够给出准确结果。在讨论过程中,我们还指出了一个似乎被忽视的局限性,它针对的是这样一种流行观点:反事实界限可以在不知道结构方程的情况下计算出来。我们还展示了一个关于姑息治疗的真实案例研究,以说明我们的算法可以如何直接用于实际目的。

英文摘要:

We assume to be given structural equations over discrete variables inducing a directed acyclic graph, namely, a structural causal model, together with data about its internal nodes. The question we want to answer is how we can compute bounds for partially identifiable counterfactual queries from such an input. We start by giving a map from structural casual models to credal networks. This allows us to compute exact counterfactual bounds via algorithms for credal nets on a subclass of structural causal models. Exact computation is going to be inefficient in general given that, as we show, causal inference is NP-hard even on polytrees. We target then approximate bounds via a causal EM scheme. We evaluate their accuracy by providing credible intervals on the quality of the approximation; we show through a synthetic benchmark that the EM scheme delivers accurate results in a fair number of runs. In the course of the discussion, we also point out what seems to be a neglected limitation to the trending idea that counterfactual bounds can be computed without knowledge of the structural equations. We also present a real case study on palliative care to show how our algorithms can readily be used for practical purposes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑