A communication-efficient multi-agent actor-critic algorithm solves distributed RL on strongly connected directed graphs by transmitting only two scalar values per communication step.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Communication-Efficient Multi-Agent Actor-Critic Algorithm for Distributed Reinforcement Learning
A communication-efficient multi-agent actor-critic algorithm solves distributed RL on strongly connected directed graphs by transmitting only two scalar values per communication step.