arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.02037math.STcs.LGstat.MLstat.TH
收藏

因果图模型中有效最小费用调整集的注记

A note on efficient minimum cost adjustment sets in causal graphical models

Glovo(Glovo公司);Universidad Torcuato Di Tella(托尔夸托迪特利亚大学);Harvard T.H. Chan School of Public Health(哈佛大学陈曾熙公共卫生学院)

Ezequiel Smucler, Andrea Rotnitzky

摘要:

我们研究了调整集的选择,估计干预下的个性化治疗规则的平均值。我们假设一个非参数的因果图模型,可能,隐藏变量和至少一个调整集组成的可观察变量。此外,我们假设可观察变量具有与之相关的正成本。我们定义的可观察调整集的成本作为组成它的变量的成本之和。我们表明,在这种设置中存在的调整集是最小成本最优的,在这个意义上说,他们产生的干预平均值的非参数估计与最小的渐近方差之间的控制可观察调整集,具有最小的成本。我们的结果是基于一个特殊的流网络与原始的因果图的建设。我们证明,可以通过计算网络上的最大流来找到最小成本最优调整集,然后通过增加路径来找到从源可到达的顶点集。optimaladj Python包实现了本文介绍的算法。

英文摘要:

We study the selection of adjustment sets for estimating the interventional mean under an individualized treatment rule. We assume a non-parametric causal graphical model with, possibly, hidden variables and at least one adjustment set comprised of observable variables. Moreover, we assume that observable variables have positive costs associated with them. We define the cost of an observable adjustment set as the sum of the costs of the variables that comprise it. We show that in this setting there exist adjustment sets that are minimum cost optimal, in the sense that they yield non-parametric estimators of the interventional mean with the smallest asymptotic variance among those that control for observable adjustment sets that have minimum cost. Our results are based on the construction of a special flow network associated with the original causal graph. We show that a minimum cost optimal adjustment set can be found by computing a maximum flow on the network, and then finding the set of vertices that are reachable from the source by augmenting paths. The optimaladj Python package implements the algorithms introduced in this paper.

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

↑