arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.04570cs.LGeess.SP
收藏

高阶图神经网络与效率的融合:稀疏Sobolev图神经网络

Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks

LTCI, Télécom Paris, Institut Polytechnique de Paris(电信巴黎理工学院LTCI实验室,巴黎综合理工学院);University of Delaware(特拉华大学);La Rochelle Université(拉罗谢尔大学);Université Paris-Saclay, CentraleSupélec, Inria(巴黎萨克雷大学,中央高等电力学院,法国国家信息与自动化研究所)

Jhony H. Giraldo, Aref Einizade, Andjela Todorovic, Jhon A. Castro-Correa, Mohsen Badiey, Thierry Bouwmans, Fragkiskos D. Malliaros

AI总结:

提出稀疏Sobolev图神经网络(S2-GNN),利用Hadamard幂次保持稀疏性,高效捕获高阶图信息,在节点分类等任务上性能与运行时间俱佳。

摘要:

图神经网络(GNN)在建模图中节点间关系方面展现出巨大潜力,但捕获大规模网络中的高阶关系仍是一大挑战。以往研究主要尝试利用图中高阶邻居的信息,涉及引入移位算子(如图拉普拉斯矩阵或邻接矩阵)的幂次。这种方法在计算和内存需求方面带来了权衡。基于图谱理论,我们做出了一个基本观察:拉普拉斯矩阵的常规幂次与Hadamard幂次在频谱上表现相似。这一观察对于在GNN中捕获高阶信息以完成节点分类和半监督学习等任务具有重要意义。因此,我们提出了一种基于图信号稀疏Sobolev范数的新型图卷积算子。我们的方法称为稀疏Sobolev图神经网络(S2-GNN),利用矩阵之间的Hadamard乘积来保持图表示中的稀疏水平。S2-GNN采用一系列具有递增Hadamard幂次的滤波器级联,以生成多样化的函数集。我们从理论上分析了S2-GNN的稳定性,以展示模型对可能的图扰动的鲁棒性。我们还对S2-GNN在各种图挖掘、半监督节点分类和计算机视觉任务中进行了全面评估。在特定用例中,我们的算法在性能和运行时间方面与最先进的GNN相比表现出竞争力。

英文摘要:

Graph Neural Networks (GNNs) have shown great promise in modeling relationships between nodes in a graph, but capturing higher-order relationships remains a challenge for large-scale networks. Previous studies have primarily attempted to utilize the information from higher-order neighbors in the graph, involving the incorporation of powers of the shift operator, such as the graph Laplacian or adjacency matrix. This approach comes with a trade-off in terms of increased computational and memory demands. Relying on graph spectral theory, we make a fundamental observation: the regular and the Hadamard power of the Laplacian matrix behave similarly in the spectrum. This observation has significant implications for capturing higher-order information in GNNs for various tasks such as node classification and semi-supervised learning. Consequently, we propose a novel graph convolutional operator based on the sparse Sobolev norm of graph signals. Our approach, known as Sparse Sobolev GNN (S2-GNN), employs Hadamard products between matrices to maintain the sparsity level in graph representations. S2-GNN utilizes a cascade of filters with increasing Hadamard powers to generate a diverse set of functions. We theoretically analyze the stability of S2-GNN to show the robustness of the model against possible graph perturbations. We also conduct a comprehensive evaluation of S2-GNN across various graph mining, semi-supervised node classification, and computer vision tasks. In particular use cases, our algorithm demonstrates competitive performance compared to state-of-the-art GNNs in terms of performance and running time.

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

↑