arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.10481cs.LGmath.OCstat.ME
收藏

DCILP:一种用于大规模因果结构学习的分布式方法

DCILP: A Distributed Approach for Large-Scale Causal Structure Learning

Shuyu Dong, Michèle Sebag, Kento Uemura, Akito Fujii, Shuang Chang, Yusuke Koyanagi, Koji Maruhashi

AI总结:

本文提出DCILP,一种用于大规模因果结构学习的分治方法,通过并行处理基于马尔可夫毯的子问题,并将局部图协调表述为整数线性规划问题,在保持精度的同时显著降低了计算复杂性。

摘要:

因果学习处理估计因果图这一计算要求高的任务。本文引入了一种用于因果图学习的新的分治方法,称为DCILP。在划分阶段,识别每个变量$X_i$的马尔可夫毯MB($X_i$),并与每个MB($X_i$)相关的因果学习子问题被独立并行处理。该方法受益于数据样本数量与考虑变量数量之间更优的比例。另一方面,它可能受到隐藏混杂因素的不利影响,因为MB($X_i$)外部的变量可能影响其内部的变量。协调在划分阶段生成的局部因果图是一个具有挑战性的组合优化问题,特别是在大规模应用中。DCILP的主要创新在于将此协调原始地表述为整数线性规划(ILP)问题,该问题可委托给ILP求解器高效处理。通过对中到大规模图的实验,并与最先进方法比较,DCILP在计算复杂性上表现出显著改进,同时在现实世界问题上保持学习精度,在合成问题上最多仅遭受轻微精度损失。

英文摘要:

Causal learning tackles the computationally demanding task of estimating causal graphs. This paper introduces a new divide-and-conquer approach for causal graph learning, called DCILP. In the divide phase, the Markov blanket MB($X_i$) of each variable $X_i$ is identified, and causal learning subproblems associated with each MB($X_i$) are independently addressed in parallel. This approach benefits from a more favorable ratio between the number of data samples and the number of variables considered. In counterpart, it can be adversely affected by the presence of hidden confounders, as variables external to MB($X_i$) might influence those within it. The reconciliation of the local causal graphs generated during the divide phase is a challenging combinatorial optimization problem, especially in large-scale applications. The main novelty of DCILP is an original formulation of this reconciliation as an integer linear programming (ILP) problem, which can be delegated and efficiently handled by an ILP solver. Through experiments on medium to large scale graphs, and comparisons with state-of-the-art methods, DCILP demonstrates significant improvements in terms of computational complexity, while preserving the learning accuracy on real-world problem and suffering at most a slight loss of accuracy on synthetic problems.

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

↑