RUMAD: Reinforcement-Unifying Multi-Agent Debate
Chao Wang, Han Lin, Huaze Tang, Huijing Lin, Wenbo Ding

TL;DR
RUMAD introduces a reinforcement learning framework for dynamic multi-agent debate, optimizing communication topology to improve reasoning accuracy and efficiency while reducing token costs significantly.
Contribution
This work presents a novel RL-based method for dynamic topology control in multi-agent debates, enhancing efficiency and robustness without access to raw agent reasoning content.
Findings
Reduces token costs by over 80%
Improves reasoning accuracy over baselines
Exhibits strong zero-shot generalization
Abstract
Multi-agent debate (MAD) systems leverage collective intelligence to enhance reasoning capabilities, yet existing approaches struggle to simultaneously optimize accuracy, consensus formation, and computational efficiency. Static topology methods lack adaptability to task complexity variations, while external LLM-based coordination risks introducing privileged knowledge that compromises debate neutrality. This work presents RUMAD (Reinforcement-Unifying Multi-Agent Debate), a novel framework that formulates dynamic communication topology control in MAD as a reinforcement learning (RL) problem. RUMAD employs a content-agnostic observation scheme that captures high-level debate dynamics avoiding access to raw agent reasoning content. RUMAD uses a multi-objective reward to model solution quality, cohesion and efficiency. A PPO-trained controller dynamically adjusts edge weights in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Advanced Graph Neural Networks · Multi-Agent Systems and Negotiation
