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.

翻译：即使产生数据的因果图未知，我们仍可通过以下步骤利用观测数据缩小平均处理效应（ATE）可能取值的范围：(1) 将因果图识别至马尔可夫等价类；(2) 对等价类中的每个图估计ATE。尽管PC算法能在强忠实性假设下识别该等价类，但其计算代价可能过高。幸运的是，识别可能ATE值集合仅需处理变量周围的局部图结构——局部发现算法正是利用这一事实提升计算效率。本文提出采用急切碰撞检测的局部发现算法（LDECC），这是一种新型局部因果发现算法，通过利用非屏蔽碰撞节点以不同于现有方法的方式定向处理变量的父节点。我们证明存在某些图结构，其中LDECC相较现有局部发现算法具有指数级性能提升，反之亦然。此外，研究表明LDECC与现有算法依赖不同的忠实性假设，我们利用这一见解弱化了识别可能ATE值集合所需的假设条件。