Distributed off-Policy Actor-Critic Reinforcement Learning with Policy Consensus
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a distributed off-policy actor critic method to solve multi-agent reinforcement learning problems. Specifically, we assume that all agents keep local estimates of the global optimal policy parameter and update their local value function estimates independently. Then, we introduce an additional consensus step to let all the agents asymptotically achieve agreement on the global optimal policy function. The convergence analysis of the proposed algorithm is provided and the effectiveness of the proposed algorithm is validated using a distributed resource allocation example. Compared to relevant distributed actor critic methods, here the agents do not share information about their local tasks, but instead they coordinate to estimate the global policy function.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 3; 2023: 0; 2024: 2; 2025: 0; 2026: 1.
11 papers.
- 2021Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysiscited by 25
- 2022Communication-Efficient Actor-Critic Methods for Homogeneous Markov Gamescited by 5
- 2021Dimension-Free Rates for Natural Policy Gradient in Multi-Agent Reinforcement Learningcited by 4
- 2021Decentralized Deterministic Multi-Agent Reinforcement Learningcited by 2
- 2022One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learningcited by 2
- 2021Federated Reinforcement Learning at the Edgecited by 1
- 2024A finite time analysis of distributed Q-learningcited by 1
- 2021Finite-Time Error Bounds for Distributed Linear Stochastic Approximationcited by 0
- 2022Cooperative Actor-Critic via TD Error Aggregationcited by 0
- 2024Achieving Collective Welfare in Multi-Agent Reinforcement Learning via Suggestion Sharingcited by 0
- 2026Variance-Reduced Q-Learning over Static and Time-Varying Networkscited by 0
- 2026Variance-Reduced Q-Learning over Static and Time-Varying Networks24 Jul 2026
- 2024Achieving Collective Welfare in Multi-Agent Reinforcement Learning via Suggestion Sharing16 Dec 2024
- 2024A finite time analysis of distributed Q-learning23 May 2024
- 2022Cooperative Actor-Critic via TD Error Aggregation25 Jul 2022
- 2022One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning31 May 2022
- 2022Communication-Efficient Actor-Critic Methods for Homogeneous Markov Games18 Feb 2022
- 2021Federated Reinforcement Learning at the Edge11 Dec 2021
- 2021Finite-Time Error Bounds for Distributed Linear Stochastic Approximation24 Nov 2021
- 2021Dimension-Free Rates for Natural Policy Gradient in Multi-Agent Reinforcement Learning23 Sep 2021
- 2021Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis8 Sep 2021
- 2021Decentralized Deterministic Multi-Agent Reinforcement Learning19 Feb 2021