arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.08070cs.LGstat.ME

用于估计因果效应的局部因果发现

Local Causal Discovery for Estimating Causal Effects

Carnegie Mellon University(卡内基梅隆大学)

Shantanu Gupta, David Childers, Zachary C. Lipton

AI总结:

本文提出局部因果发现算法 LDECC,通过非屏蔽碰撞子定向处理变量父节点,以估计可能的 ATE 集合,并在计算效率和忠实性假设上与现有方法形成互补。

摘要:

即使在数据背后的因果图未知时,我们也可以利用观测数据来缩小平均处理效应(ATE)可能取值的范围,方法是:(1)将因果图识别到一个 Markov 等价类;以及(2)为该类中的每个图估计相应的 ATE。尽管 PC 算法能够在强忠实性假设下识别该等价类,但其计算成本可能高得令人却步。幸运的是,识别可能的 ATE 值集合只需要处理变量周围的局部图结构,局部发现算法正是利用这一事实来提高计算效率。本文提出了 Local Discovery using Eager Collider Checks(LDECC),这是一种新的局部因果发现算法,它利用非屏蔽碰撞子,以不同于现有方法的方式确定处理变量父节点的方向。我们证明,存在一些图使 LDECC 相比现有局部发现算法具有指数级优势,反之亦然。此外,我们还证明 LDECC 与现有算法依赖不同的忠实性假设,并利用这一洞见弱化了识别可能 ATE 值集合所需的假设。

英文摘要:

Even when the causal graph underlying our data is unknown, we can use observational data to narrow down the possible values that an average treatment effect (ATE) can take by (1) identifying the graph up to a Markov equivalence class; and (2) estimating that ATE for each graph in the class. While the PC algorithm can identify this class under strong faithfulness assumptions, it can be computationally prohibitive. Fortunately, only the local graph structure around the treatment is required to identify the set of possible ATE values, a fact exploited by local discovery algorithms to improve computational efficiency. In this paper, we introduce Local Discovery using Eager Collider Checks (LDECC), a new local causal discovery algorithm that leverages unshielded colliders to orient the treatment's parents differently from existing methods. We show that there exist graphs where LDECC exponentially outperforms existing local discovery algorithms and vice versa. Moreover, we show that LDECC and existing algorithms rely on different faithfulness assumptions, leveraging this insight to weaken the assumptions for identifying the set of possible ATE values.

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

↑