[2602.23864] RUMAD: Reinforcement-Unifying Multi-Agent Debate
About this article
Abstract page for arXiv paper 2602.23864: RUMAD: Reinforcement-Unifying Multi-Agent Debate
Computer Science > Artificial Intelligence arXiv:2602.23864 (cs) [Submitted on 27 Feb 2026] Title:RUMAD: Reinforcement-Unifying Multi-Agent Debate Authors:Chao Wang, Han Lin, Huaze Tang, Huijing Lin, Wenbo Ding View a PDF of the paper titled RUMAD: Reinforcement-Unifying Multi-Agent Debate, by Chao Wang and 3 other authors View PDF HTML (experimental) 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 communication graph, while a dual-threshold mechanism enables fine-grained control over both agent activation and information visibility. Experimental evaluation across MMLU, GSM8K, and GPQA benchmarks demonstrates that RUMAD achieves subst...