mlsanityData to 7 Oct 2026

Adaptive Graph Mixture of Residual Experts: Unsupervised Learning on Diverse Graphs with Heterogeneous Specialization

arXiv 2510.21207 ↗First posted 24 Oct 2025cs.LGcited by 0

On the map: Mixture-of-experts → MoE for time series and graphs

Abstract (arXiv)

Graph Neural Networks (GNNs) face a fundamental adaptability challenge: their fixed message-passing architectures struggle with the immense diversity of real-world graphs, where optimal computational strategies vary by local structure and task. While Mixture-of-Experts (MoE) offers a promising pathway to adaptability, existing graph MoE methods remain constrained by their reliance on supervised signals and instability when training heterogeneous experts. We introduce ADaMoRE (Adaptive Mixture of Residual Experts), a principled framework that enables robust, fully unsupervised training of heterogeneous MoE on graphs. ADaMoRE employs a backbone-residual expert architecture where foundational encoders provide stability while specialized residual experts capture diverse computational patterns. A structurally-aware gating network performs fine-grained node routing. The entire architecture is trained end-to-end using a unified unsupervised objective, which integrates a primary reconstruction task with an information-theoretic diversity regularizer to explicitly enforce functional specialization among the experts. Theoretical analysis confirms our design improves data efficiency and training stability. Extensive evaluation across 16 benchmarks validates ADaMoRE's state-of-the-art performance in unsupervised node classification and few-shot learning, alongside superior generalization, training efficiency, and faster convergence on diverse graphs and tasks.

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 36 of its 54 references that are in the map. First posted on arXiv 24 Oct 2025.

Builds on

36 of 54 references.

Closest ancestors · 2

Same direction, newest first

  1. 2024Mixture of Link Predictors on Graphs13 Feb
  2. 2023Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modeling6 Apr

Other references · 34

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  5. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  6. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  7. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  8. 2019Similarity of Neural Network Representations Revisitedcited by 1,695
  9. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
  10. 2019Simplifying Graph Convolutional Networkscited by 1,470
  11. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  12. 2018Deep Graph Infomaxcited by 1,101
22 more
  1. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
  2. 2020Contrastive Multi-View Representation Learning on Graphscited by 651
  3. 2019Multi-scale Attributed Node Embeddingcited by 543
  4. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
  5. 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 326
  6. 2013Learning Factored Representations in a Deep Mixture of Expertscited by 275
  7. 2020Graph Representation Learning via Graphical Mutual Information Maximizationcited by 217
  8. 2021Graph Barlow Twins: A self-supervised representation learning framework for graphscited by 85
  9. 2022What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoderscited by 82
  10. 2022Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminatingcited by 57
  11. 2023Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphscited by 39
  12. 2023Simple and Asymmetric Graph Contrastive Learning without Augmentationscited by 37
  13. 2024Non-Homophilic Graph Pre-Training and Prompt Learningcited by 31
  14. 2023Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphscited by 25
  15. 2022FAITH: Few-Shot Graph Classification with Hierarchical Task Graphscited by 22
  16. 2021Graph Classification by Mixture of Diverse Expertscited by 16
  17. 2022Single-Pass Contrastive Learning Can Work for Both Homophilic and Heterophilic Graphcited by 14
  18. 2025Cooperation of Experts: Fusing Heterogeneous Information with Large Margincited by 6
  19. 2023Graph Contrastive Learning under Heterophily via Graph Filterscited by 5
  20. 2024Unsupervised Graph Neural Architecture Search with Disentangled Self-supervisioncited by 5
  21. 2025MoSE: Unveiling Structural Patterns in Graphs via Mixture of Subgraph Expertscited by 3
  22. 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

  1. 2025Training Diverse Graph Experts for Ensembles: A Systematic Empirical Study
  2. 2025GMoPE:A Prompt-Expert Mixture Framework for Graph Foundation Models
  3. 2024Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification
  4. 2026Scalable Heterogeneous Graph Learning via Heterogeneous-aware Orthogonal Prototype Experts
  5. 2026Learning How Much to Think: Difficulty-Aware Dynamic MoEs for Graph Node Classification
  6. 2025Dynamic Mixture-of-Experts for Incremental Graph Learning
  7. 2025One Router to Route Them All: Homogeneous Expert Routing for Heterogeneous Graph Transformers
  8. 2026Generalizing GNNs with Tokenized Mixture of Experts