arXiv Machine Learning

Continual Graph Multi-Agent Reinforcement Learning

The paper introduces Continual Graph Multi-Agent Reinforcement Learning (CGMARL), a framework that maps sequences of tasks into attributed graphs to capture task-specific structures such as network topologies or formation arrangements. It presents the Graph-based Formation (GRAFO) benchmark to illustrate forgetting in graph-based CMARL settings and proposes the Frozen Graph Encoder (FROG) to preserve past structural information using a frozen graph backbone. Experiments on GRAFO demonstrate that combining FROG with existing continual learning methods significantly improves performance across multiple CGMARL scenarios.

arXiv Machine Learning
Oct 16

HERO: Preserving Structure and Semantics in Heterogeneous Continual Graph Learning

HERO is a heterogeneous continual graph learning framework that preserves historical knowledge at both structural and semantic levels while adapting to new tasks. It uses DiSCo to select representative target nodes and reconstruct compact heterogeneous contexts, and applies multi-level knowledge distillation to align task-conditioned predictions with semantic responses. Experiments on four datasets with three HGNN backbones show HERO achieves best or tied-best average performance while maintaining competitive forgetting.

By Guiquan Sun, Xikun Zhang, Jingchao Ni, Dongjin Song
arXiv Machine Learning
Sep 29

HySTAR: Anchored Hypergraphs for Stable Credit Assignment in Cooperative Multi-Agent Reinforcement Learning

HySTAR is a MAPPO-based framework that addresses structural target drift in cooperative multi‑agent reinforcement learning by anchoring an overlapping sparse hypergraph as a stable high‑order value‑decomposition scaffold. It separates adaptive representation learning from a temporally consistent decomposition basis, using a spatiotemporal encoder to capture physical and task‑dependent interactions and combining temporal and structural relevance to compute agent‑specific advantages. Experiments on SMAC, GRF, Traffic Junction, and MPE show consistent improvements over MAPPO‑style, value‑factorization, and dynamic‑grouping baselines, achieving significant gains in performance and convergence speed.

By Xinglong Luo, Yuding Zhang, Yuheng Kuang, Shuxuan Yuan, Zhenni Zeng, Weiqiang Zhu, Zhenhai Ji, Zhengning Wang
arXiv Machine Learning
Oct 15

MAEM: Mitigating Recency Bias via a Replay-Free, Capacity-Controlled Dynamic Mixture of Experts for Class-Incremental Graph Learning

arXiv:2610.20238v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) excel on graph-structured data but suffer catastrophic forgetting when classes arrive sequentially. In class-incremental g...

By Junlin Chen, Wenhao Wang, Junchao Xu, Qingsong Yao, Fei Xue, Li Sun, Xiao Wang, Ruijie Wang