REVIEW 2 cited by
Selectively Sharing Experiences Improves Multi-Agent Reinforcement Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Low-Rank Agent-Specific Adaptation (LoRASA) for Multi-Agent Policy Learning
Per-agent low-rank adapters on a shared backbone let multi-agent policies specialize at a fraction of the memory cost of separate networks, with competitive benchmark performance.
-
Perspectives for Direct Interpretability in Multi-Agent Deep Reinforcement Learning
A perspective paper that advocates direct, post hoc interpretability for multi-agent deep reinforcement learning and offers a taxonomy of where those methods might apply.
Discussion (0). Continue with ORCID to comment.