Skip to main content
QUICK REVIEW

[论文解读] Understanding Oversquashing in GNNs through the Lens of Effective Resistance

Mitchell Black, Zhengchao Wan|arXiv (Cornell University)|Feb 14, 2023
Advanced Graph Neural Networks被引用 5
一句话总结

本文引入有效电阻作为图神经网络(GNN)中过度压缩现象的理论边界,证明节点间有效电阻越低,信息瓶颈越小。提出一种贪心重布线算法以最小化总有效电阻,显著提升GNN性能——在图分类任务中优于基于曲率的方法,并与基于谱隙的方法表现相当。

ABSTRACT

Message passing graph neural networks (GNNs) are a popular learning architectures for graph-structured data. However, one problem GNNs experience is oversquashing, where a GNN has difficulty sending information between distant nodes. Understanding and mitigating oversquashing has recently received significant attention from the research community. In this paper, we continue this line of work by analyzing oversquashing through the lens of the effective resistance between nodes in the input graph. Effective resistance intuitively captures the ``strength'' of connection between two nodes by paths in the graph, and has a rich literature spanning many areas of graph theory. We propose to use total effective resistance as a bound of the total amount of oversquashing in a graph and provide theoretical justification for its use. We further develop an algorithm to identify edges to be added to an input graph to minimize the total effective resistance, thereby alleviating oversquashing. We provide empirical evidence of the effectiveness of our total effective resistance based rewiring strategies for improving the performance of GNNs.

研究动机与目标

  • 将GNN中的过度压缩现象与有效电阻这一电网络和谱图理论中的概念进行理论关联。
  • 建立总有效电阻作为图中整体过度压缩程度的全局度量。
  • 开发一种实用的重布线算法,通过添加边来最小化总有效电阻。
  • 通过实证验证,降低总有效电阻可提升GNN在图分类基准上的性能。

提出的方法

  • 理论分析表明,GNN中的消息传播受节点对之间有效电阻函数的上界约束。
  • 总有效电阻定义为所有无序节点对之间有效电阻之和,作为整体过度压缩程度的全局代理指标。
  • 提出一种贪心算法,通过迭代添加能最大程度降低总有效电阻的边,提升图的连通性。
  • 该方法利用有效电阻与拉普拉斯矩阵之间的联系,借助谱图理论实现高效计算。
  • 在GNN训练前应用该算法对输入图进行重布线,通过添加捷径缓解信息瓶颈。
  • 在多种GNN架构和数据集上,将该方法与基于曲率的(SDRF)和基于谱隙的(FoSR)重布线方法进行比较。
Figure 1 : Two examples where effective resistance can be easily computed. For vertices $u$ and $v$ connected by several vertex-disjoint paths $p$ , $R_{u,v}=(\sum_{uv\text{-paths }p}\mathrm{length}(p)^{-1})^{-1}$ . Left: $R_{a,b}=6$ , the length of the path. Right: $R_{u,v}=10/9$ .
Figure 1 : Two examples where effective resistance can be easily computed. For vertices $u$ and $v$ connected by several vertex-disjoint paths $p$ , $R_{u,v}=(\sum_{uv\text{-paths }p}\mathrm{length}(p)^{-1})^{-1}$ . Left: $R_{a,b}=6$ , the length of the path. Right: $R_{u,v}=10/9$ .

实验结果

研究问题

  • RQ1有效电阻能否作为GNN中过度压缩程度的理论边界?
  • RQ2总有效电阻与GNN的整体信息流及性能之间有何关系?
  • RQ3通过有策略地添加边来最小化总有效电阻,能否提升GNN性能?
  • RQ4所提出的重布线策略在性能和可扩展性方面与现有方法(如SDRF和FoSR)相比如何?
  • RQ5增加GNN隐藏维度与重布线在缓解过度压缩方面是否存在权衡或互补关系?

主要发现

  • 所提出的GTR重布线方法在多种GNN架构上优于SDRF,并与FoSR性能相当,尤其在R-GCN和R-GIN模型上表现突出。
  • 在R-GCN上,GTR显著优于FoSR,表明全局电阻最小化对关系型GNN尤为有效。
  • 不存在普遍最优的加边数量;性能取决于数据集,需作为超参数进行调优。
  • 总有效电阻的降低与GNN准确率的提升呈正相关,验证了其作为过度压缩缓解代理指标的有效性。
  • 重布线与增加隐藏维度是互补策略,两者结合可同时带来性能提升。
  • 理论分析确认,总有效电阻对过度压缩的上界比谱隙更紧,尽管两者均与图连通性相关。
Figure 2 : The edges $\{a,b\}$ and $\{u,v\}$ have the same Balanced Forman curvature of $\operatorname{Ric}(a,b)=\operatorname{Ric}(u,v)-6/5$ . However, their effective resistance are different ( $R_{a,b}=1$ and $R_{u,v}=3/5$ ). This shows how the curvature only measure local connectivity and does n
Figure 2 : The edges $\{a,b\}$ and $\{u,v\}$ have the same Balanced Forman curvature of $\operatorname{Ric}(a,b)=\operatorname{Ric}(u,v)-6/5$ . However, their effective resistance are different ( $R_{a,b}=1$ and $R_{u,v}=3/5$ ). This shows how the curvature only measure local connectivity and does n

更好的研究,从现在开始

从阅读论文到最终审阅,大幅缩短您的研究时间。

无需绑定信用卡

本解读由 AI 生成,并经人工编辑审核。