mlsanityData to 7 Oct 2026

A Communication-Efficient Multi-Agent Actor-Critic Algorithm for Distributed Reinforcement Learning

arXiv 1907.03053 ↗First posted 6 Jul 2019cs.LG cs.MA stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

This paper considers a distributed reinforcement learning problem in which a network of multiple agents aim to cooperatively maximize the globally averaged return through communication with only local neighbors. A randomized communication-efficient multi-agent actor-critic algorithm is proposed for possibly unidirectional communication relationships depicted by a directed graph. It is shown that the algorithm can solve the problem for strongly connected graphs by allowing each agent to transmit only two scalar-valued variables at one time.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 9; 2022: 4; 2023: 1; 2024: 1; 2025: 1.

16 papers.

Sort: