arXiv AI

MOC: Multi-Order Communication in LLM-based Multi-Agent Systems

arXiv:2606. 02359v1 Announce Type: new Abstract: Despite the remarkable progress of Large Language Model (LLM) based Multi-Agent Systems, most research focuses on optimizing coordination topology while largely underexploring the equally critical problem: how to transmit and optimize messages among agents effectively?

arXiv AI
Sep 2

Control-Data Flow Separation: Stable Prompt Optimization in Multi-Agent LLMs

The paper introduces control‑data flow separation to improve prompt optimization in multi‑agent large language model systems. By representing execution protocols as typed, validated program objects and keeping task‑relevant content as unstructured language, the method prevents prompt edits from corrupting critical routing, formatting, or termination signals. Experiments on synthetic reasoning, collaborative review generation, and insurance rating workflows show that this approach maintains 100% protocol validity while consistently enhancing task performance.

By Wentao Zhang, Syed Shariyar Murtaza, Junaid Ahmad Bhatti, Utkarsh Soni, Yifan Nie, Eugene Wen, Yuntian Deng
arXiv AI
Aug 11

M$^3$Prune: Hierarchical Communication Graph Pruning for Efficient Multi-Modal Multi-Agent Retrieval-Augmented Generation

arXiv:2511. 19969v2 Announce Type: replace Abstract: Recent advancements in multi-modal retrieval-augmented generation (mRAG), which enhance multi-modal large language models (MLLMs) with external knowledge, have demonstrated that the collective intelligence of multiple agents can significantly outperform a single model through effective communication.

By Weizi Shao, Taolin Zhang, Zijie Zhou, Chen Chen, Chengyu Wang, Xiaofeng He
arXiv AI
Sep 24

Do We Need Complex Topology Control? Distinct-Peer Random Routing Improves Cost-Efficiency in Sparse Multi-Agent Debate

The paper investigates whether complex communication topologies are necessary for effective multi‑agent debate (MAD) among large language models. It demonstrates that a simple random-without-replacement routing policy—where each agent debates with two newly sampled peers each round—consistently improves the accuracy‑cost trade‑off in sparse MAD setups. Additionally, the study shows that lightweight deliberation stopping can further reduce inference costs without sacrificing accuracy.

By Boxuan Wang, Zhuoyun Li, Xiaowei Huang, Yi Dong
arXiv AI
Sep 25

Epistemic-Probabilistic Model for Guarded Multi-Agent LLM Coordination

The paper introduces Epistemic Probabilistic Language Agents (EPLA), a neuro‑symbolic architecture designed to enable coordination among multi‑agent large language models (LLMs) under uncertainty. EPLA employs a Symbolic Guard that provides structured diagnostic feedback, allowing the LLM to generate typed actions while the Guard controls their execution against an authoritative symbolic state. The authors formalize an epistemic layer using gossip testbeds and epistemic lottery gossip models, combining view‑based call histories with agent‑indexed probability weights to address gaps in social behavior and coordination mechanisms for agentic LLMs.

By Mehdi Nasiri, Mohammad Saeed Arvenaghi, Sadegh Vaezi, Ebrahim Ardeshir-Larijani
arXiv AI
Sep 15

BusMA: A Bus Communication Substrate for Multi-Agent Systems

BusMA introduces a bus-based communication substrate for multi‑agent systems, enabling any agent to address others through a shared channel. The framework includes agent registration, message routing, and shared memory management, and defines four communication intents—discussion, challenge, guidance, and request for explanation—to facilitate fine‑grained interaction. Experiments with two leading LLMs on 13 tasks in visual reasoning, mathematical reasoning, and knowledge retrieval show that BusMA consistently outperforms existing hierarchical manager‑worker and router‑based message passing methods.

By Yanwen Peng, Delvin Ce Zhang, Xi Wang, Nikolaos Aletras