R.I.P.
π»
Ghosted
Reward-Guided Autoregressive Graph Generation for Efficient Multi-Agent Communication Topology Design
August 20, 2026 Β· Grace Period Β· π ICONIP 2026
Authors
Poomphob Suwannapichat, Boonyarit Changaival, Caesar Wu, Pascal Bouvry
arXiv ID
2608.20099
Category
cs.MA: Multiagent Systems
Cross-listed
cs.CL,
cs.LG
Citations
0
Venue
ICONIP 2026
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. Recent work on automatic topology design, ARG-Designer, has reframed this problem as autoregressive graph generation. However, its training objective provides no explicit incentive for the model to generate sparse and efficient topologies. We address this limitation by introducing a Reward-Guided Autoregressive Graph Generation (RGA-Designer) inspired by Reinforcement Learning from Human Feedback (RLHF). We train a reward model that jointly captures task correctness and structural compactness, and then fine-tune the pretrained graph generator using the reward model as feedback. Our method preserves task accuracy at the level of ARG-Designer while reducing token consumption by an average of 20.5%.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Multiagent Systems
R.I.P.
π»
Ghosted
Mean Field Multi-Agent Reinforcement Learning
π
π
The Cartographer
A Survey and Critique of Multiagent Deep Reinforcement Learning
π
π
The Cartographer
A Survey of Learning in Multiagent Environments: Dealing with Non-Stationarity
π
π
The Cartographer
Collaborative vehicle routing: a survey
R.I.P.
π»
Ghosted