GraphTorque: Torque-Driven Rewiring Graph Neural Network
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 45 of its 69 references that are in the map. First posted on arXiv 29 Jul 2025.
Builds on
45 of 69 references.
References · 45
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
33 more
- 2019Diffusion Improves Graph Learningcited by 414
- 2019Your Classifier is Secretly an Energy Based Model and You Should Treat it Like Onecited by 405
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 343
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 311
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
- 2023Exphormer: Sparse Transformers for Graphscited by 170
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
- 2023PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Predictioncited by 137
- 2020AM-GCN: Adaptive Multi-channel Graph Convolutional Networkscited by 121
- 2022FoSR: First-order spectral rewiring for addressing oversquashing in GNNscited by 105
- 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 98
- 2022Expander Graph Propagationcited by 75
- 2023Energy-based Out-of-Distribution Detection for Graph Neural Networkscited by 68
- 2023Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingcited by 67
- 2022On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networkscited by 64
- 2019Dynamic Graph Message Passing Networkscited by 62
- 2022Oversquashing in GNNs through the lens of information contraction and graph expansioncited by 53
- 2022Shortest Path Networks for Graph Property Predictioncited by 46
- 2023Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?cited by 41
- 2024Macro Graph Neural Networks for Online Billion-Scale Recommender Systemscited by 40
- 2022Rewiring with Positional Encodings for Graph Neural Networkscited by 36
- 2023PC-Conv: Unifying Homophily and Heterophily with Two-fold Filteringcited by 28
- 2023Probabilistically Rewired Message-Passing Neural Networkscited by 26
- 2023Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphscited by 25
- 2023Towards Deep Attention in Graph Neural Networks: Problems and Remediescited by 24
- 2023LazyGNN: Large-Scale Graph Neural Networks via Lazy Propagationcited by 16
- 2024Joint Graph Rewiring and Feature Denoising via Spectral Resonancecited by 12
- 2024Vul-LMGNNs: Fusing language models and online-distilled graph neural networks for code vulnerability detectioncited by 11
- 2024Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphscited by 8
- 2016Block Models and Personalized PageRankcited by 7
Built on by
Not cited yet.