An In-Depth Analysis of Discretization Methods for Communication Learning using Backpropagation with Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Communication is crucial in multi-agent reinforcement learning when agents are not able to observe the full state of the environment. The most common approach to allow learned communication between agents is the use of a differentiable communication channel that allows gradients to flow between agents as a form of feedback. However, this is challenging when we want to use discrete messages to reduce the message size, since gradients cannot flow through a discrete communication channel. Previous work proposed methods to deal with this problem. However, these methods are tested in different communication learning architectures and environments, making it hard to compare them. In this paper, we compare several state-of-the-art discretization methods as well as a novel approach. We do this comparison in the context of communication learning using gradients from other agents and perform tests on several environments. In addition, we present COMA-DIAL, a communication learning approach based on DIAL and COMA extended with learning rate scaling and adapted exploration. Using COMA-DIAL allows us to perform experiments on more complex environments. Our results show that the novel ST-DRU method, proposed in this paper, achieves the best results out of all discretization methods across the different environments. It achieves the best or close to the best performance in each of the experiments and is the only method that does not fail on any of the tested environments.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 35 references that are in the map. First posted on arXiv 9 Aug 2023.
Builds on
18 of 35 references.
References · 18
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,558
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,353
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2017Counterfactual Multi-Agent Policy Gradientscited by 751
- 2016Learning to Communicate with Deep Multi-Agent Reinforcement Learningcited by 575
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 465
- 2016Learning Multiagent Communication with Backpropagationcited by 366
- 2017Emergence of Grounded Compositional Language in Multi-Agent Populationscited by 263
- 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 231
- 2017Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of Symbolscited by 125
6 more
- 2019On the Pitfalls of Measuring Emergent Communicationcited by 71
- 2021Learning to Ground Multi-Agent Communication with Autoencoderscited by 37
- 2015Learning language through picturescited by 12
- 2020Learning to Communicate Using Counterfactual Reasoningcited by 9
- 2022Emergent Quantized Communicationcited by 7
- 2022An Analysis of Discretization Methods for Communication Learning with Multi-Agent Reinforcement Learningcited by 6
Built on by
Not cited yet.