arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.07580cs.LGcs.AI
收藏

图神经网络的图凝聚

Graph Condensation for Graph Neural Networks

Michigan State University(密歇根州立大学);Carnegie Mellon University(卡内基梅隆大学);UCLA(加州大学洛杉矶分校);Snap Inc.(Snap公司)

Wei Jin, Lingxiao Zhao, Shichang Zhang, Yozen Liu, Jiliang Tang, Neil Shah

摘要:

考虑到大规模图在现实世界应用中的普遍性,训练神经模型的存储和时间已经引起了越来越多的关注。为了缓解这种担忧,我们提出并研究了图神经网络(GNNs)的图凝聚问题。具体来说,我们的目标是将大型原始图压缩成一个小型的、合成的、信息量高的图,这样在小型图和大型图上训练的GNN就具有相当的性能。我们通过优化梯度匹配损失来模仿原始图上的GNN训练轨迹来解决凝聚问题,并设计了一种同时凝聚节点期货和结构信息的策略。大量的实验已经证明了所提出的框架在将不同的图数据集压缩成信息量更小的图方面的有效性。特别是,我们能够在Reddit上将原始测试准确率近似为95.3%,在Flickr上为99.8%,在Citeseer上为99.0%,同时将它们的图大小减少了99.9%以上,并且浓缩图可以用于训练各种GNN架构。代码发布在https://github.com/ChandlerBang/GCond上。

英文摘要:

Given the prevalence of large-scale graphs in real-world applications, the storage and time for training neural models have raised increasing concerns. To alleviate the concerns, we propose and study the problem of graph condensation for graph neural networks (GNNs). Specifically, we aim to condense the large, original graph into a small, synthetic and highly-informative graph, such that GNNs trained on the small graph and large graph have comparable performance. We approach the condensation problem by imitating the GNN training trajectory on the original graph through the optimization of a gradient matching loss and design a strategy to condense node futures and structural information simultaneously. Extensive experiments have demonstrated the effectiveness of the proposed framework in condensing different graph datasets into informative smaller graphs. In particular, we are able to approximate the original test accuracy by 95.3% on Reddit, 99.8% on Flickr and 99.0% on Citeseer, while reducing their graph size by more than 99.9%, and the condensed graphs can be used to train various GNN architectures.Code is released at https://github.com/ChandlerBang/GCond.

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

↑