Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Networks
Abstract
The core operation of current Graph Neural Networks (GNNs) is the aggregation enabled by the graph Laplacian or message passing, which filters the neighborhood information of nodes. Though effective for various tasks, in this paper, we show that they are potentially a problematic factor underlying all GNN models for learning on certain datasets, as they force the node representations similar, making the nodes gradually lose their identity and become indistinguishable. Hence, we augment the aggregation operations with their dual, diversification operators that make the node more distinct and preserve the identity. Such augmentation replaces the aggregation with a two-channel filtering process that, in theory, is beneficial for enriching the node representations. In practice, the proposed two-channel filters can be easily patched on existing GNN methods with diverse training strategies, including spectral and spatial (message passing) methods. In the experiments, we observe desired characteristics of the models and significant performance boost upon the baselines on $9$ node classification tasks.
Benchmark Results
Tested on 3 datasets 1 baseline value reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 34 | MLP | 0.9230
±0.0070 | |
| 53 | GraphSAGE | 0.9000
±0.0365 best reported | best today: Graph Neural Networks Need Cluster-Normalize-Activate Modules (NeurIPS 2024) |
| 152 | FB-GCN2*-32 | 0.8486
±0.0702 | This paper |
| 189 | SAGE | 0.8269 | |
| 236 | FB-GCN2*-64 | 0.8054
±0.0513 | This paper |
| 274 | FB-GCN2*-8 | 0.7811
±0.0541 | This paper |
| 277 | GCN2*-32 | 0.7784 | This paper |
| 280 | FB-GWNN | 0.7778
±0.0834 | This paper |
| 288 | FB-GCN2-16 | 0.7703
±0.0757 | This paper |
| 308 | FB-GCN | 0.7570
±0.0480 best reported | |
| 312 | FB-GraphSAINT | 0.7568
±0.0271 | This paper |
| 315 | GCN2*-16 | 0.7541 | This paper |
| 316 | GCN2*-64 | 0.7541 | This paper |
| 355 | GraphSAINT | 0.7297 | This paper |
| 362 | GCN2*-8 | 0.7270 | This paper |
| 389 | FB-Geom-GCN-P | 0.7027
±0.0270 | This paper |
| 399 | GWNN | 0.6944 | This paper |
| 442 | FB-GAT | 0.6486
±0.0648 | This paper |
| 471 | FB-Geom-GCN-I | 0.6221
±0.0463 | This paper |
| 476 | FB-Geom-GCN-S | 0.6216
±0.0243 | This paper |
| 540 | FB-GraphSAGE | 0.5805
±0.0129 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 | |
| 138 | SAGE | 0.8269 | |
| 157 | GraphSAGE | 0.8196
±0.0739 best reported | best today: Heterophily-Aware Graph Attention Network (2023) |
| 158 | GAT | 0.8190
±0.0540 best reported | best today: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 170 | GCN | 0.8082
±0.0360 best reported | best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 178 | FB-GWNN | 0.8011
±0.0944 | This paper |
| 192 | FB-GraphSAINT | 0.7838
±0.0811 | This paper |
| 208 | FB-GCN2-16 | 0.7757
±0.0271 | This paper |
| 217 | FB-GCN2*-8 | 0.7676
±0.0379 | This paper |
| 219 | GCN2*-16 | 0.7649 | This paper |
| 220 | FB-GCN2-64 | 0.7649
±0.0460 | This paper |
| 226 | Geom-GCN-S | 0.7540 best reported | best at pub: Non-Local Graph Neural Networks (2020) |
| 240 | FB-GCN2*-32 | 0.7451
±0.0019 | This paper |
| 244 | GCN2*-32 | 0.7432 | This paper |
| 245 | FB-GCN | 0.7430
±0.0440 best reported | |
| 257 | GCN2*-8 | 0.7297 | This paper |
| 265 | GCN2*-64 | 0.7243 | This paper |
| 279 | GWNN | 0.7067 | This paper |
| 285 | GraphSAINT | 0.7027 | This paper |
| 333 | FB-GAT | 0.6486
±0.1054 | This paper |
| 334 | FB-Geom-GCN-P | 0.6486
±0.0405 | This paper |
| 353 | FB-GraphSAGE | 0.6314
±0.0909 | This paper |
| 370 | Geom-GCN-P | 0.6081 | This paper |
| 413 | FB-Geom-GCN-I | 0.5738
±0.0062 | This paper |
| 419 | Geom-GCN-I | 0.5676 | This paper |
| 421 | FB-Geom-GCN-S | 0.5654
±0.0086 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 42 | MLP | 0.4026
±0.0108 | |
| 68 | GraphSAGE | 0.3899
±0.0085 best reported | best today: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 135 | GCN | 0.3690 | |
| 192 | FB-GCN2*-8 | 0.3587
±0.0098 | This paper |
| 220 | FB-GCN2*-16 | 0.3540
±0.0122 | This paper |
| 239 | GCN2*-8 | 0.3489 | This paper |
| 240 | FB-GCN2*-64 | 0.3489
±0.0217 | This paper |
| 241 | FB-GCN2*-32 | 0.3473
±0.0095 | This paper |
| 261 | GCN2*-16 | 0.3418 | This paper |
| 274 | GCN2*-32 | 0.3378 | This paper |
| 293 | GCN2*-64 | 0.3272 | This paper |
| 313 | FB-Geom-GCN-I | 0.3145
±0.0236 | This paper |
| 319 | FB-Geom-GCN-S | 0.3125
±0.0095 | This paper |
| 322 | FB-GCN | 0.3121
±0.0435 | This paper |
| 327 | FB-Geom-GCN-P | 0.3102
±0.0061 | This paper |
| 336 | FB-GAT | 0.3066
±0.0221 | This paper |
| 453 | FB-GraphSAGE | 0.2327
±0.0860 | This paper |
| 466 | FB-GWNN | 0.2224
±0.0132 | This paper |
| 481 | GWNN | 0.2092 | This paper |
| 490 | FB-GraphSAINT | 0.1908
±0.0119 | This paper |
| 491 | GraphSAINT | 0.1789 | This paper |
