无需标注数据,让图神经网络自动分工协作,提升复杂图的建模能力。
Adaptive Graph Mixture of Residual Experts: Unsupervised Learning on Diverse Graphs with Heterogeneous Specialization
- 用主干+残差专家架构,让不同专家专注处理不同图结构。
- 在16个基准上实现无监督节点分类最优性能,收敛更快。
- 适合处理多样图数据,尤其擅长少样本学习场景。
图神经网络(GNN)面临根本性适应性挑战:其固定的消息传递架构难以应对真实世界中结构多样的图,不同局部结构和任务需要不同的计算策略。尽管混合专家(MoE)为适应性提供了可行路径,但现有图级MoE方法仍受限于对监督信号的依赖,以及训练异质专家时的不稳定性。本文提出ADaMoRE(自适应残差专家混合),一种可实现完全无监督训练的异质图MoE框架。ADaMoRE采用主干-残差专家结构,基础编码器保障稳定性,专用残差专家捕捉多样化计算模式。一个结构感知门控网络实现细粒度节点路由。整个架构通过统一的无监督目标端到端训练,结合主要重构任务与信息论多样性正则化,显式强制专家功能分化。理论分析表明该设计提升了数据效率与训练稳定性。在16个基准上的大量实验验证了ADaMoRE在无监督节点分类与少样本学习中的领先性能,同时展现出更优的泛化能力、训练效率与快速收敛性。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。