NA2Q: Neural Attention Additive Model for Interpretable Multi-Agent Q-Learning

Zichuan Liu, Zichuan Liu, Yuanyang Zhu, Chunlin Chen
2/12/2026

No official code found. Best implementation: zichuan-liu/NA2Q (24 stars, last commit 2024-01-14).

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 to different state-of-the-art methods on all challenging tasks, while yielding human-like interpretability.

View on arXivView PDF

Code Implementations(1)

zichuan-liu/NA2QCommunity100%

[ICML'23] Official PyTorch Implementation of NA2Q, and a comprehensive benchmark based on pymarl

242Shell, PythonApr 26, 20232 years ago
attentionexplainabilityinterpretabilitymarlmulti-agent-reinforcement-learning+3 more

Similar Papers

Cite this paper

@article{liu2026naq,
  title  = {NA2Q: Neural Attention Additive Model for Interpretable Multi-Agent Q-Learning},
  author = {Zichuan Liu and Zichuan Liu and Yuanyang Zhu and Chunlin Chen},
  year   = {2026},
  eprint = {2304.13383},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2304.13383},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.13383.svg)](https://codeofpaper.com/paper/2304.13383)

Discussion