Gauge-Equivariant Graph Networks via Self-Interference Cancellation
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) excel on homophilous graphs but often fail under heterophily due to self-reinforcing and phase-inconsistent signals. We propose a Gauge-Equivariant Graph Network with Self-Interference Cancellation (GESC), which replaces additive aggregation with a projection-based interference mechanism. Unlike prior magnetic or gauge-equivariant GNNs that rely on additive message mixing, GESC explicitly models self-interference arising from redundant low-frequency components. We show that the absence of interference handling in existing gauge-based GNNs is a primary driver of oversmoothing under gauge transport. We introduce a U(1) phase connection followed by a rank-1 projection that suppresses self-parallel components before attention, and a sign-aware gate that regulates negatively aligned neighbors. Across diverse graph benchmarks, GESC consistently outperforms recent state-of-the-art models while offering a unified, interference-aware view of message passing. Our code is available at https://github.com/ChoiYoonHyuk/GESC.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 56 of its 70 references that are in the map. First posted on arXiv 20 Nov 2025.
Builds on
56 of 70 references.
References · 56
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2016Group Equivariant Convolutional Networkscited by 1,154
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
38 more
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2016Complex Embeddings for Simple Link Predictioncited by 897
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2019Diffusion Improves Graph Learningcited by 414
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2020SIGN: Scalable Inception Graph Neural Networkscited by 283
- 2019Gauge Equivariant Convolutional Networks and the Icosahedral CNNcited by 262
- 2021Geometric and Physical Quantities Improve E(3) Equivariant Message Passingcited by 225
- 2022Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNscited by 208
- 2017CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filterscited by 203
- 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
- 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022Sign and Basis Invariant Networks for Spectral Graph Representation Learningcited by 176
- 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
- 2022How Powerful are Spectral Graph Neural Networkscited by 169
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2021MagNet: A Neural Network for Directed Graphscited by 104
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 94
- 2020Gauge Equivariant Mesh CNNs: Anisotropic convolutions on geometric graphscited by 90
- 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 88
- 2021GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophilycited by 84
- 2020Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependenciescited by 81
- 2020Sheaf Neural Networkscited by 80
- 2019Signed Graph Attention Networkscited by 62
- 2018GEMSEC: Graph Embedding with Self Clusteringcited by 61
- 2021Dissecting the Diffusion Process in Linear Graph Convolutional Networkscited by 58
- 2020Lattice gauge equivariant convolutional neural networkscited by 45
- 2021Tree Decomposed Graph Neural Networkcited by 35
50 most cited of 56 All 56 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.