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
this https URL

本篇研究提出并研究了图卷积神经网络 (GNNs) 的图压缩问题，旨在将原始大图压缩成小型合成图以提高神经模型训练的时间性能，通过优化梯度匹配损失和设计一种策略同时压缩节点特征和结构信息，有效地将不同图数据集压缩成信息丰富的较小图并将其用于训练各种 GNN 体系结构，测试结果在 Reddit 上可达到 95.3％，在 Flickr 上可达到 99.8％，在 Citeseer 上可达到 99.0％，同时将其图的尺寸缩小了 99.9％以上。