Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification
On the map: Mixture-of-experts → MoE for time series and graphs
Abstract (arXiv)
Graph neural networks excel at graph representation learning but struggle with heterophilous data and long-range dependencies. And graph transformers address these issues through self-attention, yet face scalability and noise challenges on large-scale graphs. To overcome these limitations, we propose GNNMoE, a universal model architecture for node classification. This architecture flexibly combines fine-grained message-passing operations with a mixture-of-experts mechanism to build feature encoding blocks. Furthermore, by incorporating soft and hard gating layers to assign the most suitable expert networks to each node, we enhance the model's expressive power and adaptability to different graph types. In addition, we introduce adaptive residual connections and an enhanced FFN module into GNNMoE, further improving the expressiveness of node representation. Extensive experimental results demonstrate that GNNMoE performs exceptionally well across various types of graph data, effectively alleviating the over-smoothing issue and global noise, enhancing model robustness and adaptability, while also ensuring computational efficiency on large-scale graphs.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in MoE for time series and graphs, one of 12 directions in Mixture-of-experts. Builds on 5 of its 11 references that are in the map. First posted on arXiv 11 Dec 2024.
Builds on
5 of 11 references.
References · 5
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 131
- 2022Hierarchical Graph Transformer with Adaptive Node Samplingcited by 72
- 2022Model Degradation Hinders Deep Graph Neural Networkscited by 26
- 2023PathMLP: Smooth Path Towards High-order Homophilycited by 8
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Learning How Much to Think: Difficulty-Aware Dynamic MoEs for Graph Node Classificationcited by 0
- 2026Ftextsuperscript2LP-AP: Fast & Flexible Label Propagation with Adaptive Propagation Kernelcited by 0
- 2026Gate the Filter, Not the Message: Node-Channel Mixtures for Pre-Propagation GNNscited by 0
- 2026PreGS: A Parameter-Transfer-Based Multi-Expert Graph Neural Network for Node Classificationcited by 0
- 2026PreGS: A Parameter-Transfer-Based Multi-Expert Graph Neural Network for Node Classification22 Sep 2026
- 2026Gate the Filter, Not the Message: Node-Channel Mixtures for Pre-Propagation GNNs1 Jun 2026
- 2026Ftextsuperscript2LP-AP: Fast & Flexible Label Propagation with Adaptive Propagation Kernel22 Apr 2026
- 2026Learning How Much to Think: Difficulty-Aware Dynamic MoEs for Graph Node Classification13 Apr 2026
Similar, not cited
Close in wording, no citation either way
- 2025Adaptive Graph Mixture of Residual Experts: Unsupervised Learning on Diverse Graphs with Heterogeneous Specialization
- 2024Node-wise Filtering in Graph Neural Networks: A Mixture of Experts Approach
- 2025Training Diverse Graph Experts for Ensembles: A Systematic Empirical Study
- 2026Generalizing GNNs with Tokenized Mixture of Experts
- 2025Self-Adaptive Graph Mixture of Models
- 2024GNNAnatomy: Rethinking Model-Level Explanations for Graph Neural Networks
- 2025GMoPE:A Prompt-Expert Mixture Framework for Graph Foundation Models
- 2024Bootstrapping Heterogeneous Graph Representation Learning via Large Language Models: A Generalized Approach