arXiv:2506.16110cs.LG2025-06ICML被引 11

通过保留谱特性的稀疏化,缓解图神经网络的过挤压问题

Mitigating Over-Squashing in Graph Neural Networks by Spectrum-Preserving Sparsification

  • 采用保持图谱特性的稀疏化方法重构图结构
  • 在减少结构瓶颈的同时提升分类准确率
  • 适合关注图结构优化与模型稳定性的研究者

图神经网络的消息传递机制常因图中某些区域的结构性瓶颈,导致远距离节点间信息交换困难,这一现象称为过挤压。现有图重连方法多忽略保持原图关键属性(如谱特性),且依赖增加边数以提升连通性,带来显著计算开销并加剧过平滑风险。本文提出一种新型图重连方法——谱保真稀疏化,可在保持图稀疏性的同时增强连通性,并有效维持原图拉普拉斯谱特性,实现结构瓶颈缓解与图属性保留的平衡。实验验证了该方法在分类精度和谱保留方面的优越性,优于多个强基线方法。

原文摘要 · Abstract (English)

The message-passing paradigm of Graph Neural Networks often struggles with exchanging information across distant nodes typically due to structural bottlenecks in certain graph regions, a limitation known as \textit{over-squashing}. To reduce such bottlenecks, \textit{graph rewiring}, which modifies graph topology, has been widely used. However, existing graph rewiring techniques often overlook the need to preserve critical properties of the original graph, e.g., \textit{spectral properties}. Moreover, many approaches rely on increasing edge count to improve connectivity, which introduces significant computational overhead and exacerbates the risk of over-smoothing. In this paper, we propose a novel graph rewiring method that leverages \textit{spectrum-preserving} graph \textit{sparsification}, for mitigating over-squashing. Our method generates graphs with enhanced connectivity while maintaining sparsity and largely preserving the original graph spectrum, effectively balancing structural bottleneck reduction and graph property preservation. Experimental results validate the effectiveness of our approach, demonstrating its superiority over strong baseline methods in classification accuracy and retention of the Laplacian spectrum.

图神经网络谱特性稀疏化过挤压

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。