Multi-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity

24 March 2021

Papers citing "Multi-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity"

2 / 2 papers shown

Title
Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis Ziyi Chen Yi Zhou Rongrong Chen Shaofeng Zou 19 24 0 08 Sep 2021
A Multistep Lyapunov Approach for Finite-Time Analysis of Biased Stochastic Approximation Gang Wang Bingcong Li G. Giannakis 31 28 0 10 Sep 2019