arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.06232stat.ME
收藏

结合时间背景信息的基于评分的因果发现

Score-Based Causal Discovery with Temporal Background Information

Tobias Ellegaard Larsen, Claus Thorn Ekstrøm, Anne Helby Petersen

AI总结:

本研究针对时间背景信息改进因果发现的问题,开发了TGES算法及相关术语,通过分层背景知识评分标准学习受限DAG等价类,理论证明其返回分层MPDAG且包含真实DAG,模拟和真实数据验证了其优于时间PC算法的性能。

摘要:

时间背景信息可通过定向边和识别相关调整集来改进因果发现算法。我们开发了时间贪婪等价搜索(TGES)算法,以及分层背景知识下基于评分的因果发现所需的关键术语。TGES利用观测数据和分层背景知识学习有向无环图(DAG)的受限马尔可夫等价类。为构建TGES,我们制定了一个考虑分层背景知识的评分标准。我们为TGES建立了理论结果:该算法始终返回分层最大定向部分有向无环图(分层MPDAG),且在大样本极限下该分层MPDAG包含真实DAG。我们通过模拟研究表明,使用分层背景知识可带来增益,且与时间PC算法相比,其精确-召回权衡有所改善。我们还提供了一个关于生命历程健康数据的真实案例。

英文摘要:

Temporal background information can improve causal discovery algorithms by orienting edges and identifying relevant adjustment sets. We develop the Temporal Greedy Equivalence Search (TGES) algorithm and terminology essential for score-based causal discovery with tiered background knowledge. TGES learns a restricted Markov equivalence class of directed acyclic graphs (DAGs) using observational data and tiered background knowledge. To construct TGES we formulate a scoring criterion that accounts for tiered background knowledge. We establish theoretical results for TGES, stating that the algorithm always returns a tiered maximally oriented partially directed acyclic graph (tiered MPDAG) and that this tiered MPDAG contains the true DAG in the large sample limit. We present a simulation study indicating a gain from using tiered background knowledge and an improved precision-recall trade-off compared to the temporal PC algorithm. We provide a real-world example on life-course health data.

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

↑