面向异配图学习的带参数化拉普拉斯算子的灵活扩散范围方法
Flexible Diffusion Scopes with Parameterized Laplacian for Heterophilic Graph Learning
AI总结:
针对传统图拉普拉斯限制GNN长程信息捕捉、异配图表现不佳的问题,提出参数化拉普拉斯与拓扑重连机制,构建PD-GCN和PD-GAT模型,可自适应调整扩散范围,在多数真实基准上性能超SOTA。
摘要:
图神经网络(GNNs)捕捉长程和全局拓扑信息的能力受限于传统图拉普拉斯算子的作用范围,导致其在部分数据集尤其是异配图上的表现不尽如人意。为解决这一局限,我们提出了一类新型参数化拉普拉斯矩阵,经证明,该矩阵在控制节点间扩散距离方面比传统图拉普拉斯算子更具灵活性,能够通过图上的扩散自适应捕捉长程信息。具体而言,我们首先证明了图上的扩散距离与谱距离之间存在保序关系。基于这一结论,我们论证了参数化拉普拉斯算子能够加速长程信息的扩散,且拉普拉斯算子中的参数可实现扩散范围的灵活性。基于上述理论结果,我们提出了拓扑引导的重连机制,用于为异配图捕捉有用的长程邻域信息。结合该机制与新型拉普拉斯算子,我们提出了两种具备灵活扩散范围的图神经网络:基于参数化扩散的图卷积网络(PD-GCN)和图注意力网络(PD-GAT)。合成实验表明,在不同的图同质性水平下,新型拉普拉斯算子的参数与参数化图神经网络的性能高度相关,这验证了我们提出的新型图神经网络确实能够调整参数,为不同程度的异配图自适应捕捉全局信息。在7个真实世界基准数据集中,它们在6个上的表现优于当前最优(SOTA)模型,进一步证实了其优越性。
英文摘要:
The ability of Graph Neural Networks (GNNs) to capture long-range and global topology information is limited by the scope of conventional graph Laplacian, leading to unsatisfactory performance on some datasets, particularly on heterophilic graphs. To address this limitation, we propose a new class of parameterized Laplacian matrices, which provably offers more flexibility in controlling the diffusion distance between nodes than the conventional graph Laplacian, allowing long-range information to be adaptively captured through diffusion on graph. Specifically, we first prove that the diffusion distance and spectral distance on graph have an order-preserving relationship. With this result, we demonstrate that the parameterized Laplacian can accelerate the diffusion of long-range information, and the parameters in the Laplacian enable flexibility of the diffusion scopes. Based on the theoretical results, we propose topology-guided rewiring mechanism to capture helpful long-range neighborhood information for heterophilic graphs. With this mechanism and the new Laplacian, we propose two GNNs with flexible diffusion scopes: namely the Parameterized Diffusion based Graph Convolutional Networks (PD-GCN) and Graph Attention Networks (PD-GAT). Synthetic experiments reveal the high correlations between the parameters of the new Laplacian and the performance of parameterized GNNs under various graph homophily levels, which verifies that our new proposed GNNs indeed have the ability to adjust the parameters to adaptively capture the global information for different levels of heterophilic graphs. They also outperform the state-of-the-art (SOTA) models on 6 out of 7 real-world benchmark datasets, which further confirms their superiority.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。