Cross-attentive Cohesive Subgraph Embedding to Mitigate Oversquashing in GNNs
Not on the map. Why?
Abstract (arXiv)
Graph neural networks (GNNs) have achieved strong performance across various real-world domains. Nevertheless, they suffer from oversquashing, where long-range information is distorted as it is compressed through limited message-passing pathways. This bottleneck limits their ability to capture essential global context and decreases their performance, particularly in dense and heterophilic regions of graphs. To address this issue, we propose a novel graph learning framework that enriches node embeddings via cross-attentive cohesive subgraph representations to mitigate the impact of excessive long-range dependencies. This framework enhances the node representation by emphasizing cohesive structure in long-range information but removing noisy or irrelevant connections. It preserves essential global context without overloading the narrow bottlenecked channels, which further mitigates oversquashing. Extensive experiments on multiple benchmark datasets demonstrate that our model achieves consistent improvements in classification accuracy over standard baseline methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 35 references that are in the map. First posted on arXiv 29 Mar 2026.
Builds on
23 of 35 references.
References · 23
- 2017Attention Is All You Needcited by 60,361
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
- 2019Graph U-Netscited by 492
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2019Self-Attention Graph Poolingcited by 421
- 2022Long Range Graph Benchmarkcited by 263
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
- 2020Graph Clustering with Graph Neural Networkscited by 163
11 more
- 2022FoSR: First-order spectral rewiring for addressing oversquashing in GNNscited by 105
- 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 98
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 97
- 2022A Generalization of ViT/MLP-Mixer to Graphscited by 93
- 2023Locality-Aware Graph-Rewiring in GNNscited by 56
- 2023Homophily-enhanced Structure Learning for Graph Clusteringcited by 9
- 2025Mitigating Over-Squashing in Graph Neural Networks by Spectrum-Preserving Sparsificationcited by 8
- 2024Graph Contrastive Learning with Cohesive Subgraph Awarenesscited by 6
- 2024Parallel k-Core Decomposition with Batched Updates and Asynchronous Readscited by 1
- 2024Tackling Oversmoothing in GNN via Graph Sparsification: A Truss-based Approachcited by 1
- 2024Parallel Higher-order Truss Decompositioncited by 1
Built on by
Not cited yet.