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.
The paper introduces K‑GAT, a neuro‑symbolic framework that generates multi‑agent collaboration topologies conditioned on external evidence, treating the design as a knowledge‑conditioned structure learning problem. Unlike prior methods that rely mainly on large language model parameters, K‑GAT integrates external evidence directly into autoregressive graph generation, reducing redundant interactions and improving verification in knowledge‑intensive tasks. Experiments on benchmarks such as the expert‑level GPQA dataset show K‑GAT achieving a +15.7% accuracy gain over the LLM‑Debate baseline while using fewer computational tokens.
By Yangxiao Jiang, Jiarun Fan, Mingcong Xu, Yanxi Guo, Jiwen Feng, Shanqing Xu, Mengchen Qian, Wei Chen, Xiaojin Zhang
arXiv:2508. 00429v5 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have achieved remarkable success in graph-based learning by propagating information among neighbor nodes via predefined aggregation mechanisms.
By Minghao Guo, Xi Zhu, Qingyue Jiao, Xiujin Liu, Haochen Xue, Chong Zhang, Shuhang Lin, Jingyuan Huang, Ziyi Ye, Yongfeng Zhang
GRAIN is a single-agent reinforcement learning framework that improves large language models’ robustness to real‑world shifts in node identifiers and task formulations by treating reasoning as a semantic parsing and tool‑execution pipeline. It introduces a Structure Invariance Reward that validates intermediate graphs against ground‑truth topologies, encouraging the model to learn genuine text‑to‑structure mappings instead of overfitting to surface patterns. On the new GRIT benchmark, GRAIN surpasses multi‑agent baselines by 16.45% in accuracy, reduces latency by about 24%, and halves the out‑of‑distribution gap of fine‑tuned models while remaining robust on large‑scale graphs beyond the training distribution.
By Zike Yuan, Han Zhang, Jianzhi Yan, Le Liu, Cai Ke, Huozhi Zhou, Jian Xie, Jiran Yin, Yukun Cao, Yue Yu, Hui Wang, Ming Liu, Bing Qin
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:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
By Yunhao Liang, Pujun Zhang, Yuan Qu, Jingyuan Yang, Shaochong Lin, Zuo-jun Max Shen
arXiv:2606. 26327v1 Announce Type: cross Abstract: In actor-critic reinforcement learning, network architectures are typically manually designed.
By Boyun Zhang, Chao Wang, Kai Wu
arXiv:2608. 07905v1 Announce Type: new Abstract: Embodied agents using LLM-based planners often struggle with physical hallucinations, poor generalization to long-horizon tasks, and lack of environmental awareness.
By Chen Li, Sijie Cheng, Yuelin Zhang, Junxi Li, Maozhi Huang, Yang Liu, Wenbing Huang
arXiv:2607. 01942v1 Announce Type: new Abstract: LLM-based agents have shown strong potential for solving complex multi-step tasks, yet existing performance improvements often rely on either scaling to larger backbone models or task-specific fine-tuning.
By Yue Zhang, Sihan Chen, Ziwen Huang, Hanyun Cui, Kangye Ji, Zhi Wang
arXiv:2605. 17393v2 Announce Type: replace Abstract: Coordination graphs are a central abstraction in cooperative multi-agent reinforcement learning (MARL), yet existing sparse-graph learners lack a theoretically grounded mechanism to decide which edges should exist and how much information each edge should carry.
By Wei Duan, Junyu Xuan, En Yu, Xiaoyu Yang, Jie Lu
arXiv:2607. 17038v1 Announce Type: new Abstract: This paper addresses key technical challenges in current large language model (LLM) agent applications, including long-horizon planning, sparse reward attribution, and dynamic environmental interaction, by designing and optimizing an intelligent agent workflow.
By Amez Amanj Ali, Kuo-Kun Tseng
arXiv:2607. 15660v1 Announce Type: new Abstract: While LLM agents demonstrate strong reasoning abilities in compact and well-defined scenarios, they struggle to maintain robustness and effectiveness when faced with large-scale, diverse, and dynamic real-world environments that demand seamless tool integration.
By Shuaiyu Zhou, Fengpeng Yue, Zengjie Hu, Yuanzhe Shen, Chenyang Zhang, feng hong, Cao Liu, Ke Zeng