Teaching on a Budget in Multi-Agent Deep Reinforcement Learning
Ercüment İlhan, Jeremy Gow, Diego Pérez-Liébana · 2019 · 36 citationsRead the paper
Deep Reinforcement Learning (RL) algorithms can solve complex sequential decision tasks successfully. However, they have a major drawback of having poor sample efficiency which can often be tackled by knowledge reuse. In Multi-Agent Reinforcement Learning (MARL) this drawback becomes worse, but at the same time, a new set of opportunities to leverage knowledge are also presented through agent interactions. One promising approach among these is peer-to-peer action advising through a teacher-student framework. Despite being introduced for single-agent RL originally, recent studies show that it can also be applied to multi-agent scenarios with promising empirical results. However, studies in this line of research are currently very limited. In this paper, we propose heuristics-based action advising techniques in cooperative decentralised MARL, using a nonlinear function approximation based task-level policy. By adopting Random Network Distillation technique, we devise a measurement for agents to assess their knowledge in any given state and be able to initiate the teacher-student dynamics with no prior role assumptions. Experimental results in a gridworld environment show that such an approach may indeed be useful and needs to be further investigated.
What the full text shows
Shown in the lab- The proposed heuristics-based action advising approach in cooperative decentralized MARL is useful for accelerating learning. (Tested in a 10x10 gridworld environment with 3 agents and 3 landmarks using independent DQNs.)
- Setup
- 10x10 gridworld with 3 agents and 3 landmarks; agents use a multilayer perceptron (MLP) with one hidden layer of 256 units.
- How
- The authors implemented a teacher-student framework where agents use Random Network Distillation (RND) to measure state uncertainty and determine when to ask for or give advice. They combined independent DQNs (with double Q-learning, prioritized replay, dueling networks, and noisy nets) with early advising and importance advising heuristics.
- Limitations
- The environment used is representationaly and mechanically simple. · The approach lacks theoretical convergence guarantees due to the use of independent DQNs in a non-stationary environment.
Summarized by Gemma 4 from the open-access full text · 16 Oct 2026. Read it