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

GFlowCausal:用于因果发现的生成流网络

GFlowCausal: Generative Flow Networks for Causal Discovery

National University of Singapore(新加坡国立大学);Huawei Noah’s Ark Lab(华为诺亚方舟实验室)

Wenqian Li, Yinchuan Li, Shengyu Zhu, Yunfeng Shao, Jianye Hao, Yan Pang

摘要:

因果发现旨在揭示一组变量之间的因果结构。基于得分的方法主要集中在搜索最佳的有向无环图(DAG)的基础上预定义的得分函数。然而,由于搜索能力有限,它们中的大多数都不适用于大规模。受生成流网络中主动学习的启发,我们提出了一种新的方法来学习一个DAG从观测数据称为GFlowCausal。它将图的搜索问题转化为生成问题,在生成问题中,直接边是逐渐增加的。GFlowCausal的目标是学习最佳策略,通过顺序动作生成高回报的DAG,其概率与预定义的奖励成比例。我们提出了一个基于传递闭包的即插即用模块,以确保有效的采样。理论分析表明,该模块能有效地保证图的无环性和最终状态与全连通图的一致性。我们在合成和真实数据集上进行了广泛的实验,结果表明所提出的方法是优越的,在大规模环境中也表现良好。

英文摘要:

Causal discovery aims to uncover causal structure among a set of variables. Score-based approaches mainly focus on searching for the best Directed Acyclic Graph (DAG) based on a predefined score function. However, most of them are not applicable on a large scale due to the limited searchability. Inspired by the active learning in generative flow networks, we propose a novel approach to learning a DAG from observational data called GFlowCausal. It converts the graph search problem to a generation problem, in which direct edges are added gradually. GFlowCausal aims to learn the best policy to generate high-reward DAGs by sequential actions with probabilities proportional to predefined rewards. We propose a plug-and-play module based on transitive closure to ensure efficient sampling. Theoretical analysis shows that this module could guarantee acyclicity properties effectively and the consistency between final states and fully-connected graphs. We conduct extensive experiments on both synthetic and real datasets, and results show the proposed approach to be superior and also performs well in a large-scale setting.

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

↑