GRAIN: Multi-Granular and Implicit Information Aggregation Graph Neural Network for Heterophilous Graphs

Songwei Zhao, Yuan Jiang, Zijing Zhang, Yang Yu, Hechang Chen
4/9/2025
cs.LGcs.AI

No official code found. Best implementation: Songwei-Zhao/GRAIN (3 stars, last commit 2025-07-14).

Abstract

Graph neural networks (GNNs) have shown significant success in learning graph representations. However, recent studies reveal that GNNs often fail to outperform simple MLPs on heterophilous graph tasks, where connected nodes may differ in features or labels, challenging the homophily assumption. Existing methods addressing this issue often overlook the importance of information granularity and rarely consider implicit relationships between distant nodes. To overcome these limitations, we propose the Granular and Implicit Graph Network (GRAIN), a novel GNN model specifically designed for heterophilous graphs. GRAIN enhances node embeddings by aggregating multi-view information at various granularity levels and incorporating implicit data from distant, non-neighboring nodes. This approach effectively integrates local and global information, resulting in smoother, more accurate node representations. We also introduce an adaptive graph information aggregator that efficiently combines multi-granularity and implicit data, significantly improving node representation quality, as shown by experiments on 13 datasets covering varying homophily and heterophily. GRAIN consistently outperforms 12 state-of-the-art models, excelling on both homophilous and heterophilous graphs.

View on arXivView PDF

Code Implementations(1)

Songwei-Zhao/GRAINCommunity71%

GRAIN: Multi-Granular and implicit Information Aggregation Graph Neural Network for Heterophilous Graphs

31PythonAug 17, 20241 years ago

Similar Papers

Cite this paper

@article{zhao2025grain,
  title  = {GRAIN: Multi-Granular and Implicit Information Aggregation Graph Neural Network for Heterophilous Graphs},
  author = {Songwei Zhao and Yuan Jiang and Zijing Zhang and Yang Yu and Hechang Chen},
  year   = {2025},
  eprint = {2504.06649},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.06649v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.06649.svg)](https://codeofpaper.com/paper/2504.06649)

Discussion