arXiv:2610.08647v1 Announce Type: new
Abstract: LLM-based agents solve complex multi-step tasks, but sequential execution incurs substantial latency. In principle, parallelizing work across multiple...
By Yexiong Lin, Shanshan Ye, Yu Yao, Zhen Fang, Bo Han, Tongliang Liu
arXiv:2605. 20173v2 Announce Type: replace Abstract: Production LLM agents combine stochastic model outputs with deterministic software systems, yet the boundary between the two is rarely treated as a first-class architectural object.
By Vasundra Srinivasan
arXiv:2607. 25656v1 Announce Type: new Abstract: Complex tasks often decompose into parallelizable yet interdependent subtasks, making orchestration critical to the performance of multi-agent systems (MAS).
By Zhenzhen Ren, Jiyan He, Xinpeng Zhang, Zhenxing Qian, Ke Han, Shuxin Zheng, GuoBiao Li, Xiaoqing Zhang
Translating natural-language planning intent into verified plans is a longstanding challenge: people communicate goals in language, while classical planners require formal PDDL specifications. Recent agentic frameworks bridge this gap by orchestrating a pool of specialized repair agents inside a verifier-checked refinement loop, but the orchestrator at the centre is itself a prompted frontier LLM, paying a frontier-LLM API call at every refinement step.
MAS-Loop introduces an execution‑grounded framework that couples an Orchestrator with a trajectory‑conditioned Refiner to close the feedback loop in training‑time multi‑agent system design. For each task, the Orchestrator builds and runs a source MAS, then the Refiner uses the resulting trajectory to locate failures, diagnose them, and propose bounded patches to agents or execution settings. The updated MAS is re‑executed, and the pairwise comparison of outcomes provides learning signals that enable both components to co‑evolve, yielding stronger systems and a new dataset, MAS‑JudgeCorpus, for trajectory‑aware MAS research.
By Hehai Lin, Qi Yang, Chengwei Qin
The paper introduces a game-theoretic framework for coordinating multi-agent large language model (LLM) systems, modeling orchestrator–worker interactions as a bilevel coordination game. It analyzes textual reflection as stochastic movement over semantic memory states, providing finite-time bounds, lower bounds, and an information-theoretic impossibility result. Building on these insights, the authors propose Stochastic Reflective Memory Ascent (SRMA), a grounded evaluation mechanism that guarantees convergence under certain conditions and demonstrates improved performance on 500 SWE‑bench instances.
By Yihang Chen, Yuxiang Chen, Yuxuan Huang, Meng Fang, Weilin Luo, Jun Wang