arXiv AI

Remember and Reweight: Enhancing Multi-Agent Debate with Experience Memory and Confidence Estimation

The paper introduces R$^2$-MAD, a framework that enhances multi-agent debate by giving agents an experience memory from past debates. It uses a debate-state-aware retrieval policy to adjust concept priors based on current consensus, and derives confidence weights from retrieved experiences to modulate peer influence. Experiments demonstrate consistent improvements over existing single-agent and MAD baselines.

arXiv AI
Jun 2

Demystifying Multi-Agent Debate: The Role of Confidence and Diversity

arXiv:2601. 19921v2 Announce Type: replace-cross Abstract: Multi-agent debate (MAD) is widely used to improve large language model (LLM) performance through test-time scaling, yet recent work shows that vanilla MAD often underperforms simple majority vote despite higher computational cost.

By Xiaochen Zhu, Caiqi Zhang, Yizhou Chi, Tom Stafford, Nigel Collier, Andreas Vlachos
arXiv Computation and Language
Aug 25

Meta-Moderator: Empowering Multi-Agent Debate with Meta-Cognition

Meta-Moderator is a learnable framework that treats moderation as a meta‑cognitive process, monitoring debate utility, controlling deliberation, and adjudicating final answers. It is trained independently of the debaters through outcome‑driven policy optimization, allowing dynamic regulation of debate rather than relying on fixed budgets or untrained judges. Across five benchmarks, Meta‑Moderator outperforms common decision layers, transfers across tasks and system configurations, and selectively allocates debate to reduce mis‑aggregation after informative hypotheses appear.

By Wentao Hu, Zhuoyue Wan, Jinhao Shen, Chen Jason Zhang, Xiaoyong Wei, Qing Li
arXiv AI
Jun 30

Mixture of Debaters: Learn to Debate at Architectural Level in Multi-Agent Reasoning

arXiv:2606. 29425v1 Announce Type: new Abstract: Existing multi-agent debate frameworks suffer from two critical limitations: they rely on static architectures where agent roles and coordination patterns are fixed at design time, and they require instantiating multiple model copies, incurring substantial computational overhead.

By Dayong Liang, Kaisong Gong, Yi Cai, Changmeng Zheng, Xiao-Yong Wei