E2GNN: Efficient Graph Neural Network Ensembles for Semi-Supervised Classification
Abstract
This work studies ensemble learning for graph neural networks (GNNs) under the popular semi-supervised setting. Ensemble learning has shown superiority in improving the accuracy and robustness of traditional machine learning by combing the outputs of multiple weak learners. However, adopting a similar idea to integrate different GNN models is challenging because of two reasons. First, GNN is notorious for its poor inference ability, so naively assembling multiple GNN models would deteriorate the inference efficiency. Second, when GNN models are trained with few labeled nodes, their performance are limited. In this case, the vanilla ensemble approach, e.g., majority vote, may be sub-optimal since most base models, i.e., GNNs, may make the wrong predictions. To this end, in this paper, we propose an efficient ensemble learner--E2GNN to assemble multiple GNNs in a learnable way by leveraging both labeled and unlabeled nodes. Specifically, we first pre-train different GNN models on a given data scenario according to the labeled nodes. Next, instead of directly combing their outputs for label inference, we train a simple multi-layer perceptron--MLP model to mimic their predictions on both labeled and unlabeled nodes. Then the unified MLP model is deployed to infer labels for unlabeled or new nodes. Since the predictions of unlabeled nodes from different GNN models may be incorrect, we develop a reinforced discriminator to effectively filter out those wrongly predicted nodes to boost the performance of MLP. By doing this, we suggest a principled approach to tackle the inference issues of GNN ensembles and maintain the merit of ensemble learning: improved performance. Comprehensive experiments over both transductive and inductive settings, across different GNN backbones and 8 benchmark datasets, demonstrate the superiority of E2GNN. Notably, our E2GNN shows good robustness towards feature- and topology-level perturbations. The code is anonymously released in
Benchmark Results
Tested on 3 datasets 7 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 223 | SGC | 0.8509
±0.0648 best reported | |
| 348 | GLNN | 0.8360
±0.0022 best reported | best at pub: Frameless Graph Knowledge Distillation (2023) Difference within reported uncertainty; not counted as underperformance. |
| 361 | E2GNN | 0.8353
±0.0019 | This paper |
| 362 | MLPs | 0.8353
±0.0019 | This paper |
| 485 | GEENI | 0.8236
±0.0028 | This paper |
| 502 | EKD-W | 0.8228
±0.0050 | This paper |
| 517 | GNNE | 0.8211
±0.0034 | This paper |
| 536 | EKD-U | 0.8198
±0.0082 | This paper |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 116 | SAGE | 0.8881
±0.0015 best reported | best at pub: Marginal Nodes Matter: Towards Structure Fairness in Graphs (KDD 2023) best today: Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment (TMLR 2025) |
| 125 | GraphSAGE | 0.8864
±0.0030 | |
| 210 | MLP | 0.8690
±0.0074 | |
| 335 | E2GNN | 0.8185
±0.0045 | This paper |
| 336 | MLPs | 0.8185
±0.0045 | This paper |
| 417 | EKD-W | 0.8034
±0.0029 | This paper |
| 428 | GLNN | 0.8027
±0.0036 | prev best: Frameless Graph Knowledge Distillation (2023) |
| 503 | GNNE | 0.7953
±0.0029 | This paper |
| 521 | EKD-U | 0.7945
±0.0035 | This paper |
| 524 | GEENI | 0.7943
±0.0024 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GCN | 0.9302
±0.0011 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) |
| 2 | RSE + RGCN (70b) | 0.8852
±0.0019 | |
| 3 | LEMP+T | 0.8825 | |
| 9 | SAGE | 0.8771 | |
| 12 | APPNP | 0.8754 best reported | best at pub: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 31 | GAT | 0.8533 best reported | best at pub: Efficient Tuning and Inference for Large Language Models on Textual Graphs (IJCAI 2024) |
| 237 | MLP | 0.7469
±0.0085 | |
| 247 | E2GNN | 0.7323
±0.0043 | This paper |
| 248 | MLPs | 0.7323
±0.0043 | This paper |
| 263 | EKD-W | 0.7092
±0.0053 | This paper |
| 264 | GLNN | 0.7069
±0.0117 | This paper |
| 265 | GNNE | 0.7023
±0.0022 | This paper |
| 271 | GEENI | 0.6879
±0.0057 | This paper |
| 274 | SGC | 0.6836
±0.0059 | This paper |
