arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.02675cs.LGcs.AIstat.ML
收藏

从低阶条件独立恢复因果结构

Recovering Causal Structures from Low-Order Conditional Independencies

University of Lübeck(吕贝克大学)

Marcel Wienöbst, Maciej Liśkiewicz

摘要:

从数据中学习因果模型的一个常见障碍是随机变量之间的高阶条件独立(CI)关系难以估计。由于CI测试的条件集的低阶可以准确地执行,即使是少量的观察,一个合理的方法来确定因果结构是基于低阶CI。最近的研究已经证实,例如,在稀疏真因果模型的情况下,即使从零阶和一阶条件独立性中学习到的结构也会产生模型的良好近似。然而,一个具有挑战性的任务是提供方法,忠实地解释一组给定的低阶CI。在本文中,我们提出了一个算法,对于一个给定的条件独立的顺序小于或等于$k$,其中$k$是一个小的固定数,计算一个忠实的图形表示给定的集合。我们的研究结果完成和推广了以前的工作,从成对的边缘独立性学习。此外,它们能够改进0-1图模型,例如,该模型在基因组网络的估计中大量使用。

英文摘要:

One of the common obstacles for learning causal models from data is that high-order conditional independence (CI) relationships between random variables are difficult to estimate. Since CI tests with conditioning sets of low order can be performed accurately even for a small number of observations, a reasonable approach to determine casual structures is to base merely on the low-order CIs. Recent research has confirmed that, e.g. in the case of sparse true causal models, structures learned even from zero- and first-order conditional independencies yield good approximations of the models. However, a challenging task here is to provide methods that faithfully explain a given set of low-order CIs. In this paper, we propose an algorithm which, for a given set of conditional independencies of order less or equal to $k$, where $k$ is a small fixed number, computes a faithful graphical representation of the given set. Our results complete and generalize the previous work on learning from pairwise marginal independencies. Moreover, they enable to improve upon the 0-1 graph model which, e.g. is heavily used in the estimation of genome networks.

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

↑