LLM-based Multi-Agent Systems (MAS) achieve strong performance on complex reasoning tasks by coordinating multiple agents, but at the cost of substantial token consumption. Recent work on automatic topology design, ARG-Designer, has reframed this problem as autoregressive graph generation.
arXiv:2608. 20099v1 Announce Type: cross Abstract: LLM-based Multi-Agent Systems (MAS) achieve strong performance on complex reasoning tasks by coordinating multiple agents, but at the cost of substantial token consumption.
By Poomphob Suwannapichat, Boonyarit Changaival, Caesar Wu, Pascal Bouvry
Unified-MAS is a two-stage framework that decouples node implementation from orchestration in Automatic Multi-Agent Systems. It first searches external knowledge to synthesize domain‑specific node blueprints, then uses a perplexity‑guided reward to optimize bottleneck nodes. Experiments across four specialized domains show that adding Unified-MAS to existing baselines improves performance‑cost trade‑offs by up to 14.2% while lowering costs.
By Hehai Lin, Yu Yan, Zixuan Wang, Bo Xu, Sudong Wang, Weiquan Huang, Ruochen Zhao, Minzhi Li, Chengwei Qin
arXiv:2605. 17361v2 Announce Type: replace-cross Abstract: Multi-agent systems (MAS) powered by large language models (LLMs) have emerged as a powerful paradigm for complex problem solving, where performance critically depends on the underlying inter-agent communication topology.
By Xuefei Wang, Jialu Wang, Fengbo Zhang, Yihan Hu, Di Zhang, Yutong Ye, Yikun Ban, Jun Han, Ruijie Wang
arXiv:2608. 12921v1 Announce Type: cross Abstract: The performance of large language model (LLM)-based multi-agent systems (MAS) largely depends on effective communication topologies.
By Junzhi Li, Peng He, Qirui Ji, Wei Wang, Lixiang Liu, Chuxiong Sun
The paper introduces Multi-Agent Agentic Graph Learning (MAAGL), a framework that partitions a graph into communities and assigns a dedicated agent to each community for specialized reasoning. MAAGL addresses two key challenges in existing agentic graph learning: it preserves permutation invariance by summarizing structural evidence with a dynamic structural signature, and it controls context size by filtering semantic evidence to the top‑k relevant nodes. Experiments on four benchmark datasets demonstrate that MAAGL outperforms state‑of‑the‑art agentic graph learning methods.
By Liang Qu, Jianxin Li, Hua Wang