Distributional Reward Estimation for Effective Multi-Agent Deep Reinforcement Learning

被引:0
作者
Hu, Jifeng [1 ]
Sun, Yanchao [2 ]
Chen, Hechang [1 ]
Huang, Sili [1 ]
Piao, Haiyin [3 ]
Chang, Yi [1 ]
Sun, Lichao [4 ]
机构
[1] Jlilin Univ, Sch Artificial Intelligence, Changchun, Peoples R China
[2] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[3] Northwestern Polytech Univ, Xian, Peoples R China
[4] Lehigh Univ, Bethlehem, PA USA
来源
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022) | 2022年
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-agent reinforcement learning has drawn increasing attention in practice, e.g., robotics and automatic driving, as it can explore optimal policies using samples generated by interacting with the environment. However, high reward uncertainty still remains a problem when we want to train a satisfactory model, because obtaining high-quality reward feedback is usually expensive and even infeasible. To handle this issue, previous methods mainly focus on passive reward correction. At the same time, recent active reward estimation methods have proven to be a recipe for reducing the effect of reward uncertainty. In this paper, we propose a novel Distributional Reward Estimation framework for effective Multi-Agent Reinforcement Learning (DRE-MARL). Our main idea is to design the multi-action-branch reward estimation and policy-weighted reward aggregation for stabilized training. Specifically, we design the multi-action-branch reward estimation to model reward distributions on all action branches. Then we utilize reward aggregation to obtain stable updating signals during training. Our intuition is that consideration of all possible consequences of actions could be useful for learning policies. The superiority of the DRE-MARL is demonstrated using benchmark multi-agent scenarios, compared with the SOTA baselines in terms of both effectiveness and robustness.
引用
收藏
页数:14
相关论文
共 66 条
[1]   Learning dexterous in-hand manipulation [J].
Andrychowicz, Marcin ;
Baker, Bowen ;
Chociej, Maciek ;
Jozefowicz, Rafal ;
McGrew, Bob ;
Pachocki, Jakub ;
Petron, Arthur ;
Plappert, Matthias ;
Powell, Glenn ;
Ray, Alex ;
Schneider, Jonas ;
Sidor, Szymon ;
Tobin, Josh ;
Welinder, Peter ;
Weng, Lilian ;
Zaremba, Wojciech .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2020, 39 (01) :3-20
[2]  
[Anonymous], 2015, LEARNING PRESENCE CO
[3]  
[Anonymous], 2014, arXiv preprint arXiv:1406.2080
[4]  
Bellemare MG, 2017, PR MACH LEARN RES, V70
[5]  
Berner C, 2019, DOTA 2 LARGE SCALE D
[6]   Classification with asymmetric label noise: Consistency and maximal denoising [J].
Blanchard, Gilles ;
Flaska, Marek ;
Handy, Gregory ;
Pozzi, Sara ;
Scott, Clayton .
ELECTRONIC JOURNAL OF STATISTICS, 2016, 10 (02) :2780-2824
[7]   GAMA: Graph Attention Multi-agent reinforcement learning algorithm for cooperation [J].
Chen, Haoqiang ;
Liu, Yadong ;
Zhou, Zongtan ;
Hu, Dewen ;
Zhang, Ming .
APPLIED INTELLIGENCE, 2020, 50 (12) :4195-4205
[8]  
Corazza1 Jan, 2022, REINFORCEMENT LEARNI
[9]  
Dabney W, 2018, AAAI CONF ARTIF INTE, P2892
[10]  
Everitt T., 2017, Reinforcement learning with a corrupted reward channel