arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.18837cs.LG
收藏

L2G-Net:通过柯西分解的局部到全局谱图神经网络

L2G-Net: Local to Global Spectral Graph Neural Networks via Cauchy Factorizations

University of Southern California(南加州大学)

Samuel Fernández-Menduiña, Eduardo Pavez, Antonio Ortega

AI总结:

提出L2G-Net,通过将图傅里叶变换精确分解为作用于子图的算子并利用柯西矩阵组合,实现局部到全局的谱图神经网络,避免全特征分解,在长程依赖任务上以极少的可学习参数达到竞争性能。

摘要:

尽管具有理论优势,基于图傅里叶变换(GFT)的谱方法由于计算特征基的成本以及所得表示缺乏顶点域局部性,很少用于图神经网络(GNN)。因此,大多数GNN依赖局部近似,如多项式拉普拉斯滤波器或消息传递,这限制了它们建模长程依赖的能力。在本文中,我们引入了一种将GFT精确分解为作用于子图的算子的方法,然后通过一系列柯西矩阵进行组合。基于这种分解,我们提出了一类新的谱GNN,称为L2G-Net(局部到全局网络)。与现有的谱方法(使用GFT时完全全局,或使用多项式滤波器时局部)不同,L2G-Net通过处理子图的谱表示,然后通过结构化矩阵组合它们来运作。我们的算法避免了完全特征分解,利用图拓扑结构以节点数的二次复杂度(按子图间最大割大小缩放)构建分解。在强调长程依赖的大图上的实验表明,L2G-Net可扩展到标准GFT无法企及的范围,并以数量级更少的可学习参数与最先进方法竞争。

英文摘要:

Despite their theoretical advantages, spectral methods based on the graph Fourier transform (GFT) are seldom used in graph neural networks (GNNs) due to the cost of computing the eigenbasis and the lack of vertex-domain locality in the resulting representations. As a result, most GNNs rely on local approximations such as polynomial Laplacian filters or message passing, which limit their ability to model long-range dependencies. In this paper, we introduce an exact factorization of the GFT into operators acting on subgraphs, which are then combined via a sequence of Cauchy matrices. Building on this factorization, we propose a new class of spectral GNNs, termed L2G-Net (Local to Global Net). Unlike existing spectral methods, which are either fully global (when using the GFT) or local (when using polynomial filters), L2G-Net operates by processing the spectral representations of subgraphs and then combining them via structured matrices. Our algorithm avoids full eigendecompositions, exploiting graph topology to construct the factorization with quadratic complexity in the number of nodes, scaled by the maximum cut size between subgraphs. Experiments stressing long-range dependencies on large graphs show that L2G-Net scales to regimes out of reach for the standard GFT, and is competitive with state-of-the-art methods with orders of magnitude fewer learnable parameters.

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

↑