arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.04879cs.LGcs.AIcs.SIstat.ML
收藏

如何找到你的友好邻居:自我监督的图形注意力设计

How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision

KAIST(韩国科学技术院)

Dongkwan Kim, Alice Oh

摘要:

图神经网络中的注意力机制被设计为向重要的邻居节点分配更大的权重以更好地表示。然而,图形注意力学习的是什么还没有很好地理解,特别是当图形是嘈杂的。在本文中,我们提出了一个自监督图注意力网络(SuperGAT),一个改进的图注意力模型的噪声图。具体来说,我们利用两个注意力形式兼容的自我监督任务来预测边缘,其存在和不存在包含的固有信息的重要性节点之间的关系。通过对边进行编码,SuperGAT在区分错误链接的邻居时学习到更多的表达注意力。我们发现两个图形特征影响注意形式和自我监督的有效性:同质性和平均度。因此,我们的配方提供了指导,当这两个图形特征已知时,使用哪种注意力设计。我们在17个真实数据集上的实验表明,我们的配方可以推广到其中的15个数据集,并且我们通过配方设计的模型显示出比基线更好的性能。

英文摘要:

Attention mechanism in graph neural networks is designed to assign larger weights to important neighbor nodes for better representation. However, what graph attention learns is not understood well, particularly when graphs are noisy. In this paper, we propose a self-supervised graph attention network (SuperGAT), an improved graph attention model for noisy graphs. Specifically, we exploit two attention forms compatible with a self-supervised task to predict edges, whose presence and absence contain the inherent information about the importance of the relationships between nodes. By encoding edges, SuperGAT learns more expressive attention in distinguishing mislinked neighbors. We find two graph characteristics influence the effectiveness of attention forms and self-supervision: homophily and average degree. Thus, our recipe provides guidance on which attention design to use when those two graph characteristics are known. Our experiment on 17 real-world datasets demonstrates that our recipe generalizes across 15 datasets of them, and our models designed by recipe show improved performance over baselines.

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

↑