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

图神经网络中基于度的节点分层

Degree-based stratification of nodes in Graph Neural Networks

Eskisehir Osmangazi University(埃斯基谢希尔奥斯曼加齐大学)

Ameen Ali, Hakan Cevikalp, Lior Wolf

AI总结:

针对图神经网络缺乏良好缩放特性的问题,提出基于节点度的分层方法,为高低度节点分别学习权重矩阵,在多数据集和GNN方法上提升性能,且验证了性能提升并非仅来自模型容量增加。

摘要:

尽管已有大量研究,图神经网络(GNNs)仍未展现出卷积神经网络、Transformer等其他深度神经网络具备的良好缩放特性。已有研究指出了潜在表示过平滑等问题,并提出了跳跃连接、复杂归一化方案等解决方法。本文提出一种基于图节点分层的不同方法。我们给出的动机是:图中的节点可被分为低度节点和高度节点两类,且这两类节点的表现可能存在差异。基于该动机,我们修改了图神经网络(GNN)架构,为每组节点分别学习权重矩阵。这种实现简单的修改似乎能在多个数据集和GNN方法上提升性能。为验证这种性能提升并非仅源于新增的模型容量,我们还对节点的随机划分执行了相同修改,结果并未带来任何性能提升。

英文摘要:

Despite much research, Graph Neural Networks (GNNs) still do not display the favorable scaling properties of other deep neural networks such as Convolutional Neural Networks and Transformers. Previous work has identified issues such as oversmoothing of the latent representation and have suggested solutions such as skip connections and sophisticated normalization schemes. Here, we propose a different approach that is based on a stratification of the graph nodes. We provide motivation that the nodes in a graph can be stratified into those with a low degree and those with a high degree and that the two groups are likely to behave differently. Based on this motivation, we modify the Graph Neural Network (GNN) architecture so that the weight matrices are learned, separately, for the nodes in each group. This simple-to-implement modification seems to improve performance across datasets and GNN methods. To verify that this increase in performance is not only due to the added capacity, we also perform the same modification for random splits of the nodes, which does not lead to any improvement.

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

↑