Alleviating subgraph-induced oversmoothing in link prediction via coarse graining
Published in Neurocomputing, 2025, 2025
We address the oversmoothing problem in link prediction caused by repetitive high-degree nodes across subgraphs. Our method introduces a coarse-graining strategy that merges strongly correlated nodes, yielding more diverse receptive fields and reducing subgraph size. This not only mitigates oversmoothing but also improves scalability and efficiency of GNN-based link prediction.
Recommended citation: Zhu X, Hao D, Gao Z, et al. Alleviating subgraph-induced oversmoothing in link prediction via coarse graining[J]. Neurocomputing, 2025: 130666.
Download Paper