Dual Ensembled Multiagent Q-Learning with Hypernet Regularizer
Yaodong Yang, Guangyong Chen, Hongyao Tang, Furui Liu, Danruo Deng, Pheng Ann Heng
TL;DR
DEMAR tackles multiagent overestimation in value-mixing Q-learning by linking an iterative estimation-optimization analysis to a practical algorithm. It introduces dual ensembles to produce lower, more reliable target estimates for both individual and global Q-values and couples this with a hypernet regularizer to curb the accumulation of bias during online optimization. Theoretical analysis shows how overestimation arises from target estimation and gradient propagation, and DEMAR provides explicit mechanisms to bound both sources. Empirical results on MPE and noisy SMAC show DEMAR stabilizes training and reduces overestimation, with demonstrated generality when extended to other MARL methods.
Abstract
Overestimation in single-agent reinforcement learning has been extensively studied. In contrast, overestimation in the multiagent setting has received comparatively little attention although it increases with the number of agents and leads to severe learning instability. Previous works concentrate on reducing overestimation in the estimation process of target Q-value. They ignore the follow-up optimization process of online Q-network, thus making it hard to fully address the complex multiagent overestimation problem. To solve this challenge, in this study, we first establish an iterative estimation-optimization analysis framework for multiagent value-mixing Q-learning. Our analysis reveals that multiagent overestimation not only comes from the computation of target Q-value but also accumulates in the online Q-network's optimization. Motivated by it, we propose the Dual Ensembled Multiagent Q-Learning with Hypernet Regularizer algorithm to tackle multiagent overestimation from two aspects. First, we extend the random ensemble technique into the estimation of target individual and global Q-values to derive a lower update target. Second, we propose a novel hypernet regularizer on hypernetwork weights and biases to constrain the optimization of online global Q-network to prevent overestimation accumulation. Extensive experiments in MPE and SMAC show that the proposed method successfully addresses overestimation across various tasks.
