TY - JOUR
T1 - VPF
T2 - Topology-preserving Virtual Path Fusion to tackle over-squashing
AU - Bai, Huiwen
AU - Ding, Lizhong
AU - Zhang, Junyu
AU - Zhang, Chunhui
AU - Fu, Jiarun
AU - Chang, Liang
AU - Gu, Tianlong
AU - Li, Changsheng
AU - Yuan, Ye
AU - Wang, Guoren
N1 - Publisher Copyright:
© 2026
PY - 2026/11
Y1 - 2026/11
N2 - Despite the widespread success of graph neural networks (GNNs) in various graph learning tasks, their performance is often hampered by the over-squashing issue, which impedes the propagation of messages from distant nodes and limits the expressive power of the model. Existing solutions to mitigate over-squashing primarily rely on altering graph topology to improve message flow. However, such modification of structure can disrupt the graph's intrinsic topology and corresponding inductive bias, while the introduction of extra edges may increase the risk of over-smoothing. To address these limitations, we propose the Virtual Path Fusion (VPF) framework, an enhanced GNN that tackles over-squashing by facilitating message flow through virtual paths, offering a topology-preserving solution that sidesteps the inherent risks of structural distortion and over-smoothing. Specifically, our method leverages effective resistance, a universal measure that captures both sensitivity and spectral properties, to guide the construction of virtual paths that target structurally susceptible bottlenecks. These paths are encoded via sequence models to capture long-range dependencies, thereby adaptively strengthening interactions between distant nodes. VPF is designed as a model-agnostic and plug-and-play module, making it compatible with a variety of message-passing GNN architectures, while also contributing to the mitigation of over-smoothing. Extensive experiments demonstrate that VPF consistently and significantly outperforms baseline methods across multiple benchmarks, validating virtual path augmentation as an effective and versatile strategy for tackling over-squashing. The code is available at: https://github.com/BHuiwen/VPF.
AB - Despite the widespread success of graph neural networks (GNNs) in various graph learning tasks, their performance is often hampered by the over-squashing issue, which impedes the propagation of messages from distant nodes and limits the expressive power of the model. Existing solutions to mitigate over-squashing primarily rely on altering graph topology to improve message flow. However, such modification of structure can disrupt the graph's intrinsic topology and corresponding inductive bias, while the introduction of extra edges may increase the risk of over-smoothing. To address these limitations, we propose the Virtual Path Fusion (VPF) framework, an enhanced GNN that tackles over-squashing by facilitating message flow through virtual paths, offering a topology-preserving solution that sidesteps the inherent risks of structural distortion and over-smoothing. Specifically, our method leverages effective resistance, a universal measure that captures both sensitivity and spectral properties, to guide the construction of virtual paths that target structurally susceptible bottlenecks. These paths are encoded via sequence models to capture long-range dependencies, thereby adaptively strengthening interactions between distant nodes. VPF is designed as a model-agnostic and plug-and-play module, making it compatible with a variety of message-passing GNN architectures, while also contributing to the mitigation of over-smoothing. Extensive experiments demonstrate that VPF consistently and significantly outperforms baseline methods across multiple benchmarks, validating virtual path augmentation as an effective and versatile strategy for tackling over-squashing. The code is available at: https://github.com/BHuiwen/VPF.
KW - Graph neural networks
KW - Over-squashing
KW - Sequence modeling
UR - https://www.scopus.com/pages/publications/105036338373
U2 - 10.1016/j.patcog.2026.113770
DO - 10.1016/j.patcog.2026.113770
M3 - Article
AN - SCOPUS:105036338373
SN - 0031-3203
VL - 179
JO - Pattern Recognition
JF - Pattern Recognition
M1 - 113770
ER -