N\(\text{a}^\text{2}\)q: Neural Attention Additive Model For Interpretable Multi-agent Q-learning
2023 Β· Zichuan Liu, Yuanyang Zhu, Chunlin Chen
Abstract
Value decomposition is widely used in cooperative multi-agent reinforcement learning, however, its implicit credit assignment mechanism is not yet fully understood due to black-box networks. In this work, we study an interpretable value decomposition framework via the family of generalized additive models. We present a novel method, named Neural Attention Additive Q-learning (N\(\text\{A\}^\text\{2\}\)Q), providing inherent intelligibility of collaboration behavior. N\(\text\{A\}^\text\{2\}\)Q can explicitly factorize the optimal joint policy induced by enriching shape functions to model all possible coalitions of agents into individual policies. Moreover, we construct identity semantics to promote estimating credits together with the global state and individual value functions, where local semantic masks help us diagnose whether each agent captures relevant-task information. Extensive experiments show that N\(\text\{A\}^\text\{2\}\)Q consistently achieves superior performance compared
Authors
(none)
Tags
Stats
Related papers
- Qatten: A General Framework For Cooperative Multiagent Reinforcement Learning (2020)0.00
- High-order Interactions Modeling For Interpretable Multi-agent Q-learning (2025)0.00
- Q-value Path Decomposition For Deep Multiagent Reinforcement Learning (2020)0.00
- Towards Understanding Cooperative Multi-agent Q-learning With Value Factorization (2020)0.00
- Adaptive Value Decomposition With Greedy Marginal Contribution Computation For Cooperative Multi-agent Reinforcement Learning (2023)3.58
- NQMIX: Non-monotonic Value Function Factorization For Deep Multi-agent Reinforcement Learning (2021)0.00
- Greedy-based Value Representation For Optimal Coordination In Multi-agent Reinforcement Learning (2021)0.00
- Greedy Based Value Representation For Optimal Coordination In Multi-agent Reinforcement Learning (2022)0.00