通过硬干预数据识别因果图,揭示其与干预分布的对应关系。
Characterization and Learning of Causal Graphs from Hard Interventions
- 基于多组硬干预数据,建立图形约束与do-演算规则的关联
- 提出可区分干预等价因果图的新判定方法,支持含潜变量模型
- 设计可整合多源干预数据的学习算法,适用于因果推断研究者
在经验科学中,通过观测和实验揭示因果结构是一项基本挑战。因果发现需将观测数据中的条件独立性(CI)不变性与图模型的d-分离约束相联系。本文考虑一种通用设置:可获取多个由硬干预产生的实验分布,以及可能存在的观测分布。通过比较不同干预分布,我们提出一组图形约束,这些约束与佩尔的do-演算在硬干预框架下存在根本关联。这些图形约束将每个图结构与一组与do-演算规则一致的干预分布相联系。我们刻画了含潜变量的因果图的干预等价类,并引入一种图形表示法,用于判断两个因果图是否具有相同的硬干预分布族,即是否在do-演算不变性下不可区分。我们还提出一种学习算法,用于整合来自硬干预的多组数据,并引入新的定向规则。学习目标为一组扩展图的元组,蕴含一个因果图集合。同时证明了所提算法的正确性。
原文摘要 · Abstract (English)
A fundamental challenge in the empirical sciences involves uncovering causal structure through observation and experimentation. Causal discovery entails linking the conditional independence (CI) invariances in observational data to their corresponding graphical constraints via d-separation. In this paper, we consider a general setting where we have access to data from multiple experimental distributions resulting from hard interventions, as well as potentially from an observational distribution. By comparing different interventional distributions, we propose a set of graphical constraints that are fundamentally linked to Pearl's do-calculus within the framework of hard interventions. These graphical constraints associate each graphical structure with a set of interventional distributions that are consistent with the rules of do-calculus. We characterize the interventional equivalence class of causal graphs with latent variables and introduce a graphical representation that can be used to determine whether two causal graphs are interventionally equivalent, i.e., whether they are associated with the same family of hard interventional distributions, where the elements of the family are indistinguishable using the invariances from do-calculus. We also propose a learning algorithm to integrate multiple datasets from hard interventions, introducing new orientation rules. The learning objective is a tuple of augmented graphs which entails a set of causal graphs. We also prove the soundness of the proposed algorithm.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。