paper-with-me

홈 › Papers

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

2025-10-24 · Yunlong Chu, Minglai Shao, Zengyi Wo, Bing Hao, Yuhang Liu, Ruijie Wang, Jianxin Li 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.

📄 PDF Abstract BibTeX arXiv:2510.21207

Code (0)

등록된 구현이 없습니다.

Tasks

Node ClassificationFew-Shot Learning

Similar Papers 제목 키워드 기반

Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification

2024-12-11 · Xuanze Chen, Jiajun Zhou, Shanqing Yu, Qi Xuan

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 …

Computational EfficiencyGraph Representation LearningMixture-of-Experts+3

FARM: Frame-Accelerated Augmentation and Residual Mixture-of-Experts for Physics-Based High-Dynamic Humanoid Control

2025-08-27 · Tan Jing, Shiting Chen, Yangfan Li, Weisheng Xu 외 arxiv

Unified physics-based humanoid controllers are pivotal for robotics and character animation, yet models that excel on gentle, everyday motions still stumble on explosive actions, hampering real-world deployment. We bridg…

CAMERA: Adapting to Semantic Camouflage in Unsupervised Text-Attributed Graph Fraud Detection

2026-05-19 · Junjun Pan, Yixin Liu, Yu Zheng, Lianhua Chi 외 arxiv

Text-attributed graph fraud detection (TAGFD) plays a critical role in preventing fraudulent activities on online social and e-commerce platforms. However, to evade detection, fraudsters continuously evolve their camoufl…

Fraud Detection

Self-Adaptive Graph Mixture of Models

2025-11-17 · Mohit Meena, Yash Punjabi, Abhishek A, Vishal Sharma 외 arxiv

Graph Neural Networks (GNNs) have emerged as powerful tools for learning over graph-structured data, yet recent studies have shown that their performance gains are beginning to plateau. In many cases, well-established mo…

Graph ClassificationNode ClassificationLink PredictionGraph Learning

History-Augmented Contrastive Learning With Soft Mixture of Experts for Blind Super-Resolution of Planetary Remote Sensing Images

2025-11-25 · Hui-Jia Zhao, Jie Lu, Yunqing Jiang, Xiao-Ping Lu 외 arxiv

Blind Super-Resolution (BSR) in planetary remote sensing constitutes a highly ill-posed inverse problem, characterized by unknown degradation patterns and a complete absence of ground-truth supervision. Existing unsuperv…

Blind Super-ResolutionImage ReconstructionContrastive Learning