Finite-Sample Analysis of Decentralized Temporal-Difference Learning with Linear Function Approximation

Abstract

Motivated by the emerging use of multi-agent reinforcement learning (MARL) in engineering applications such as networked robotics, swarming drones, and sensor networks, we investigate the policy evaluation problem in a fully decentralized setting, using temporal-difference (TD) learning with linear function approximation to handle large state spaces in practice. The goal of a group of agents is to collaboratively learn the value function of a given policy from locally private rewards observed in a shared environment, through exchanging local estimates with neighbors. Despite their simplicity and widespread use, our theoretical understanding of such decentralized TD learning algorithms remains limited. Existing results were obtained based on i.i.d. data samples, or by imposing an `additional' projection step to control the `gradient' bias incurred by the Markovian observations. In this paper, we provide a finite-sample analysis of the fully decentralized TD(0) learning under both i.i.d. as well as Markovian samples, and prove that all local estimates converge linearly to a small neighborhood of the optimum. The resultant error bounds are the first of its type---in the sense that they hold under the most practical assumptions ---which is made possible by means of a novel multi-step Lyapunov analysis.

25 pages, 3 figures

References in corpus (11)

• Learning to Communicate with Deep Multi-Agent Reinforcement Learning
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents
• Learning ReLU Networks on Linearly Separable Data: Algorithm, Optimality, and Generalization
• Finite-Sample Analysis of Proximal Gradient TD Algorithms
• Lyapunov Theory for Discrete Time Systems
• Finite-Time Analysis of Distributed TD(0) with Linear Function Approximation for Multi-Agent Reinforcement Learning
• Two-Timescale Voltage Control in Distribution Grids Using Deep Reinforcement Learning
• A Multistep Lyapunov Approach for Finite-Time Analysis of Biased Stochastic Approximation
• Instance-dependent ${\ell }_{\infty }$-bounds for policy evaluation in tabular reinforcement learning
• Tight Linear Convergence Rate of ADMM for Decentralized Optimization

Cited by in corpus (4)

• Byzantine-Resilient Decentralized TD Learning with Linear Function Approximation
• Online Robust Reinforcement Learning with Model Uncertainty
• Non-Asymptotic Analysis for Two Time-scale TDC with General Smooth Function Approximation
• On the Convergence of Consensus Algorithms with Markovian Noise and Gradient Bias