arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2308.02709cs.LGstat.ML
收藏

因果界限的可扩展计算

Scalable Computation of Causal Bounds

Columbia University(哥伦比亚大学)

Madhumitha Shridharan, Garud Iyengar

AI总结:

本文提出通过剪枝线性规划来高效计算含未观测混杂因子的因果查询界限,并扩展至分数LP及贪心启发式方法,显著提升可处理问题规模与运行效率。

摘要:

我们考虑在存在未观测混杂因子和离散值观测变量的因果图上计算因果查询界限的问题,其中可识别性不成立。现有的用于计算此类界限的非参数方法使用线性规划(LP)公式,但由于LP的规模随因果图中边的数量呈指数增长,现有求解器很快变得难以处理。我们表明,该LP可以被显著剪枝,从而使我们能够计算比现有技术显著更大的因果推断问题的界限。该剪枝过程使我们能够对一类特殊问题以闭式形式计算界限,包括一个被广泛研究的多个混杂处理影响结果的问题族。我们将剪枝方法扩展到分数LP,用于计算包含关于单元的额外观测信息的因果查询界限。我们表明,与实验中的基准相比,我们的方法在运行时间上提供了显著改进,并将结果扩展到有限数据设置。对于没有额外观测的因果推断,我们提出了一种高效的贪心启发式方法,能够产生高质量的界限,并且可扩展到比剪枝LP可求解的问题大几个数量级的问题。

英文摘要:

We consider the problem of computing bounds for causal queries on causal graphs with unobserved confounders and discrete valued observed variables, where identifiability does not hold. Existing non-parametric approaches for computing such bounds use linear programming (LP) formulations that quickly become intractable for existing solvers because the size of the LP grows exponentially in the number of edges in the causal graph. We show that this LP can be significantly pruned, allowing us to compute bounds for significantly larger causal inference problems compared to existing techniques. This pruning procedure allows us to compute bounds in closed form for a special class of problems, including a well-studied family of problems where multiple confounded treatments influence an outcome. We extend our pruning methodology to fractional LPs which compute bounds for causal queries which incorporate additional observations about the unit. We show that our methods provide significant runtime improvement compared to benchmarks in experiments and extend our results to the finite data setting. For causal inference without additional observations, we propose an efficient greedy heuristic that produces high quality bounds, and scales to problems that are several orders of magnitude larger than those for which the pruned LP can be solved.

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

↑