Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
12-2024
Abstract
This paper concerns imitation learning (IL) in cooperative multi-agent systems.The learning problem under consideration poses several challenges, characterized by high-dimensional state and action spaces and intricate inter-agent dependencies. In a single-agent setting, IL was shown to be done efficiently via an inverse soft-Q learning process. However, extending this framework to a multi-agent context introduces the need to simultaneously learn both local value functions to capture local observations and individual actions, and a joint value function for exploiting centralized learning.In this work, we introduce a new multi-agent IL algorithm designed to address these challenges. Our approach enables thecentralized learning by leveraging mixing networks to aggregate decentralized Q functions.We further establish conditions for the mixing networks under which the multi-agent IL objective function exhibits convexity within the Q function space.We present extensive experiments conducted on some challenging multi-agent game environments, including an advanced version of the Star-Craft multi-agent challenge (SMACv2), which demonstrates the effectiveness of our algorithm.
Keywords
Imitation learning, Multi-agent systems, soft-Q learning
Discipline
Artificial Intelligence and Robotics | Computer Sciences
Research Areas
Data Science and Engineering; Intelligent Systems and Optimization
Areas of Excellence
Digital transformation
Publication
Proceedings of the 37th Conference on Neural Information Processing Systems (NeurIPS 2024) : Vancouver Canada, December 10-15
Publisher
NeurIPS
City or Country
Canada
Citation
BUI, The Viet; MAI, Tien; and NGUYEN, Thanh.
Inverse factorized soft Q-Learning for cooperative multi-agent imitation learning. (2024). Proceedings of the 37th Conference on Neural Information Processing Systems (NeurIPS 2024) : Vancouver Canada, December 10-15.
Available at: https://ink.library.smu.edu.sg/sis_research/9818
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.