Training Diverse Graph Experts for Ensembles: A Systematic Empirical Study
On the map: Mixture-of-experts → MoE for time series and graphs
Abstract (arXiv)
Graph Neural Networks (GNNs) have become essential tools for learning on relational data, yet the performance of a single GNN is often limited by the heterogeneity present in real-world graphs. Recent advances in Mixture-of-Experts (MoE) frameworks demonstrate that assembling multiple, explicitly diverse GNNs with distinct generalization patterns can significantly improve performance. In this work, we present the first systematic empirical study of expert-level diversification techniques for GNN ensembles. Evaluating 20 diversification strategies -- including random re-initialization, hyperparameter tuning, architectural variation, directionality modeling, and training data partitioning -- across 14 node classification benchmarks, we construct and analyze over 200 ensemble variants. Our comprehensive evaluation examines each technique in terms of expert diversity, complementarity, and ensemble performance. We also uncovers mechanistic insights into training maximally diverse experts. These findings provide actionable guidance for expert training and the design of effective MoE frameworks on graph data. Our code is available at https://github.com/Hydrapse/bench-gnn-diversification.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in MoE for time series and graphs, one of 12 directions in Mixture-of-experts. Builds on 30 of its 43 references that are in the map. First posted on arXiv 21 Oct 2025.
Builds on
30 of 43 references.
Closest ancestors · 3
Same direction, newest first
- 2024Node-wise Filtering in Graph Neural Networks: A Mixture of Experts Approach5 Jun
- 2023GraphMETRO: Mitigating Complex Graph Distribution Shifts via Mixture of Aligned Experts7 Dec
- 2023Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modeling6 Apr
Other references · 27
- 2017Attention Is All You Needcited by 59,932
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
15 more
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 368
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
- 2022GOOD: A Graph Out-of-Distribution Benchmarkcited by 140
- 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 88
- 2021Subgroup Generalization and Fairness of Graph Neural Networkscited by 69
- 2021No One Representation to Rule Them All: Overlapping Features of Training Methodscited by 57
- 2021Node Dependent Local Smoothing for Scalable Graph Learningcited by 45
- 2025Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellencecited by 24
- 2023HoloNets: Spectral Convolutions do extend to Directed Graphscited by 20
- 2023Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classificationcited by 19
- 2023Clarify Confused Nodes via Separated Learningcited by 5
- 2025Mixture of Message Passing Experts with Routing Entropy Regularization for Node Classificationcited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Adaptive Graph Mixture of Residual Experts: Unsupervised Learning on Diverse Graphs with Heterogeneous Specialization
- 2025GMoPE:A Prompt-Expert Mixture Framework for Graph Foundation Models
- 2025Self-Adaptive Graph Mixture of Models
- 2026Learning How Much to Think: Difficulty-Aware Dynamic MoEs for Graph Node Classification
- 2024Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification
- 2026Scalable Heterogeneous Graph Learning via Heterogeneous-aware Orthogonal Prototype Experts
- 2024Mixture of Experts for Node Classification
- 2026Generalizing GNNs with Tokenized Mixture of Experts