提出新算法,从有隐藏混杂因素的关联数据中准确发现因果关系。
Relational Causal Discovery with Latent Confounders
- 基于FCI和RCD改进,定义适用于关联数据的新图模型
- 在真实关系数据上验证了正确识别因果结构的能力
- 适合处理现实世界中存在隐藏混杂因素的复杂关联数据
从现实世界的关联数据中估计因果效应,在因果模型和潜在混杂因素未知时极具挑战性。现有因果发现算法通常假设数据独立同分布,不适用于关联数据;而现有关联因果发现算法则假设因果充分性,这在许多真实数据集中并不成立。为此,我们提出RelFCI,一种针对具有隐藏混杂因素的关联数据的可靠且完备的因果发现算法。该工作基于快速因果推断(FCI)和关联因果发现(RCD)算法,定义了支持关联领域因果发现的新图形模型,并建立了带有隐藏混杂因素的关系d-分离的可靠性和完备性保证。实验结果表明,RelFCI在具有隐藏混杂因素的关联因果模型中能够有效识别正确的因果结构。
原文摘要 · Abstract (English)
Estimating causal effects from real-world relational data can be challenging when the underlying causal model and potential confounders are unknown. While several causal discovery algorithms exist for learning causal models with latent confounders from data, they assume that the data is independent and identically distributed (i.i.d.) and are not well-suited for learning from relational data. Similarly, existing relational causal discovery algorithms assume causal sufficiency, which is unrealistic for many real-world datasets. To address this gap, we propose RelFCI, a sound and complete causal discovery algorithm for relational data with latent confounders. Our work builds upon the Fast Causal Inference (FCI) and Relational Causal Discovery (RCD) algorithms and it defines new graphical models, necessary to support causal discovery in relational domains. We also establish soundness and completeness guarantees for relational d-separation with latent confounders. We present experimental results demonstrating the effectiveness of RelFCI in identifying the correct causal structure in relational causal models with latent confounders.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。