Selectively Sharing Experiences Improves Multi-Agent Reinforcement Learning

Matthias Gerstgrasser, Tom Danino, Sarah Keren
11/1/2023
cs.LGcs.AIcs.MA

Official code: mgerstgrasser/super (14 stars, MIT, last commit 2024-06-11).

Abstract

We present a novel multi-agent RL approach, Selective Multi-Agent Prioritized Experience Relay, in which agents share with other agents a limited number of transitions they observe during training. The intuition behind this is that even a small number of relevant experiences from other agents could help each agent learn. Unlike many other multi-agent RL algorithms, this approach allows for largely decentralized training, requiring only a limited communication channel between agents. We show that our approach outperforms baseline no-sharing decentralized training and state-of-the art multi-agent RL algorithms. Further, sharing only a small number of highly relevant experiences outperforms sharing all experiences between agents, and the performance uplift from selective experience sharing is robust across a range of hyperparameters and DQN variants. A reference implementation of our algorithm is available at https://github.com/mgerstgrasser/super.

View on arXivView PDF

Code Implementations(1)

MIT

suPER is a collaborative multi-agent RL algorithm

140Shell, PythonDec 4, 20222 years agoMIT

Similar Papers

Cite this paper

@article{gerstgrasser2023selectively,
  title  = {Selectively Sharing Experiences Improves Multi-Agent Reinforcement Learning},
  author = {Matthias Gerstgrasser and Tom Danino and Sarah Keren},
  year   = {2023},
  eprint = {2311.00865},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.00865v2}
}

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/2311.00865.svg)](https://codeofpaper.com/paper/2311.00865)

Discussion