arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2107.03597stat.ME
收藏

基于局部图的因果结构学习

Causal Structural Learning Via Local Graphs

Wenyu Chen, Mathias Drton, Ali Shojaie

摘要:

我们考虑在稀疏高维环境中学习因果结构的问题,这种环境可能会受到(可能有许多)不可测量的混杂因素以及选择偏差的影响。基于常见的大型随机网络族中的结构和线性结构方程模型(SEM)中局部结构的表示,我们提出了一种新的局部稀疏性概念,用于存在潜在变量和选择变量的一致性结构学习,并开发了一种新版本的快速因果推断(FCI)算法,该算法具有降低的计算和样本复杂度,我们将其称为本地FCI(IFCI)。稀疏性的新概念允许存在高度连接的枢纽节点,这在现实世界的网络中很常见,但对现有的方法有问题。我们的数值实验表明,lFCI算法实现了最先进的性能在许多类的大型随机网络,其性能优于现有的方法包含枢纽节点的网络。

英文摘要:

We consider the problem of learning causal structures in sparse high-dimensional settings that may be subject to the presence of (potentially many) unmeasured confounders, as well as selection bias. Based on the structure found in common families of large random networks and examining the representation of local structures in linear structural equation models (SEM), we propose a new local notion of sparsity for consistent structure learning in the presence of latent and selection variables, and develop a new version of the Fast Causal Inference (FCI) algorithm with reduced computational and sample complexity, which we refer to as local FCI (lFCI). The new notion of sparsity allows the presence of highly connected hub nodes, which are common in real-world networks, but problematic for existing methods. Our numerical experiments indicate that the lFCI algorithm achieves state-of-the-art performance across many classes of large random networks, and its performance is superior to that of existing methods for networks containing hub nodes.

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

↑