Efficient ensembles of graph neural networks
Amrit Nagarajan, Jacob R. Stevens, Anand Raghunathan
Abstract
Ensembles improve the accuracy and robustness of Graph Neural Networks (GNNs), but suffer from high latency and storage requirements. To address this challenge, we propose GNN Ensembles through Error Node Isolation (GEENI). The key concept in GEENI is to identify nodes that are likely to be incorrectly classified (error nodes) and suppress their outgoing messages, leading to simultaneous accuracy and efficiency improvements. GEENI also enables aggressive approximations of the constituent models in the ensemble while maintaining accuracy. To improve the efficacy of GEENI, we propose techniques for diverse ensemble creation and accurate error node identification. Our experiments establish that GEENI models are simultaneously up to 4.6% (3.8%) more accurate and up to 2.8X (5.7X) faster compared to non-ensemble (conventional ensemble) GNN models.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- DyGNN: Algorithm and Architecture Support of Dynamic Pruning for Graph Neural NetworksCen Chen, Kenli Li, Xiaofeng Zou, Yangfan LiDAC 2021 · 38 citations
- Node Identifiers: Compact, Discrete Representations for Efficient Graph LearningYuankai Luo, Hongkang Li, Qijiong Liu, Lei Shi et al.ICLR 2025
- Identity-aware Graph Neural NetworksJiaxuan You, Jonathan Michael Gomes Selman, Rex Ying, Jure LeskovecAAAI 2021 · 316 citations
- Deep Ensembles for Graphs with Higher-order DependenciesSteven J. Krieg, William C. Burgis, Patrick M. Soga, Nitesh V. ChawlaICLR 2023 · 1 citation
- Efficient Mixed Precision Quantization in Graph Neural NetworksSamir Moustafa, Nils M. Kriege, Wilfried N. GanstererICDE 2025 · 2 citations
