arXiv:2507.21422cs.LG2025-07

用物理扭矩原理动态重连图神经网络,提升异质与同质图的表示学习效果。

GraphTorque: Torque-Driven Rewiring Graph Neural Network

  • 借鉴力学扭矩思想,用特征距离和邻居特征构建动态重连机制。
  • 在多个基准数据集上优于现有重连方法,尤其在异质图上提升显著。
  • 适合处理复杂图结构的数据,如社交网络、知识图谱等场景。

图神经网络(GNN)通过消息传递从图结构数据中学习,但原始图中的连接可能不利于信息传播。为此,本文提出一种受力学扭矩启发的分层重连策略,动态调节消息传递过程。具体地,将节点特征距离视为力臂向量,邻居特征作为力向量,并以节点间的同质性差异加权。利用该扭矩度量,分层地修剪高扭矩边并添加低扭矩链接,从而抑制无关信息干扰,增强关键信号传递。在多个基准数据集上的实验表明,该方法在异质图和同质图上均优于现有先进重连方法。

原文摘要 · Abstract (English)

Graph Neural Networks (GNNs) have emerged as powerful tools for learning from graph-structured data, leveraging message passing to diffuse information and update node representations. However, most efforts have suggested that native interactions encoded in the graph may not be friendly for this process, motivating the development of graph rewiring methods. In this work, we propose a torque-driven hierarchical rewiring strategy, inspired by the notion of torque in classical mechanics, dynamically modulating message passing to improve representation learning in heterophilous and homophilous graphs. Specifically, we define the torque by treating the feature distance as a lever arm vector and the neighbor feature as a force vector weighted by the homophily disparity between nodes. We use the metric to hierarchically reconfigure receptive field of each layer by judiciously pruning high-torque edges and adding low-torque links, suppressing the impact of irrelevant information and boosting pertinent signals during message passing. Extensive evaluations on benchmark datasets show that the proposed approach surpasses state-of-the-art rewiring methods on both heterophilous and homophilous graphs.

图神经网络图重连表示学习

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