Ensemble-MIX: Enhancing Sample-Efficiency in Multi-Agent RL via Selective Ensemble-Based Exploration
Organizations: The Andrew and Erna Viterbi Faculty of Electrical & Computer Engineering, Technion- Israel Institute of Technology
Abstract
Multi-agent reinforcement learning (MARL) methods have achieved state-of-the-art results on a range of multi-agent tasks. Yet, MARL algorithms typically require significantly more environment interactions than their single-agent counterparts to converge, a problem exacerbated by the difficulty in exploring over a large joint action space and the high variance intrinsic to MARL environments. To tackle these issues, we propose a novel algorithm that combines a decomposed centralized critic with decentralized ensemble learning, incorporating several key contributions. The main component in our scheme is a selective exploration method that leverages ensemble kurtosis. We extend the global decomposed critic with a diversity-regularized ensemble of individual critics and utilize its excess kurtosis to guide exploration toward high-uncertainty states and actions. To improve sample efficiency, we train the centralized critic with a novel truncated variation of the TD() algorithm, enabling efficient off-policy learning with reduced variance. On the actor side, our suggested algorithm adapts the mixed samples approach to MARL, mixing on-policy and off-policy loss functions for training the actors. This approach balances between stability and efficiency and outperforms purely off-policy learning. The evaluation shows our method outperforms state-of-the-art baselines on standard MARL benchmarks, including a variety of SMAC II maps.
Figures & tables
| Method | Backbone | Exploration signal |
| MAVEN | VD | mutual information |
| PAC | MAPG | entropy |
| FOX | VD | mutual information |
| CMAE | VD | goal / entropy |
| EMC | VD | curiosity |
| SUNRISE | SAC | variance & Q-learning |
| Ensemble MIX, smaller ensemble ( ) | Ensemble MIX, without retrace | No exploration ( ) | Ensemble MIX with variance exploration | Original, all components (with exploration) | |
| 1c3s5z | |||||
| MMM2 | |||||
| MMM3 | |||||
| MACF |
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
| Algorithm Parameters | |
| HyperParameters | Value |
| (train interval) | 20K |
| (num test episodes) | 24 |
| 0.01 | |
| 0.001 | |
| 0.001 | |
Multi-Agent Reinforcement Learning
Multi-agent reinforcement learning studies how interacting agents learn coordinated or competitive policies through shared experience and rewards.
See all 371 papers