Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms

10 November 2020

Papers citing "Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms"

9 / 9 papers shown

Title
Regularized Q-Learning with Linear Function Approximation Jiachen Xi Alfredo Garcia P. Momcilovic 120 2 0 26 Jan 2024
Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise Shaan ul Haque S. Khodadadian S. T. Maguluri 128 11 0 31 Dec 2023
Finite-Time Error Bounds for Greedy-GQ Yue Wang Yi Zhou Shaofeng Zou 98 2 0 06 Sep 2022
Finite-Time Analysis of Fully Decentralized Single-Timescale Actor-Critic Qijun Luo Xiao Li 102 1 0 12 Jun 2022
Target Network and Truncation Overcome The Deadly Triad in $Q$ -Learning Zaiwei Chen John-Paul Clarke S. T. Maguluri 67 19 0 05 Mar 2022
PER-ETD: A Polynomially Efficient Emphatic Temporal Difference Learning Method Ziwei Guan Tengyu Xu Yingbin Liang 83 4 0 13 Oct 2021
Online Robust Reinforcement Learning with Model Uncertainty Yue Wang Shaofeng Zou OOD OffRL 134 110 0 29 Sep 2021
Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis Ziyi Chen Yi Zhou Rongrong Chen Shaofeng Zou 95 25 0 08 Sep 2021
Multi-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity Ziyi Chen Yi Zhou Rongrong Chen OffRL 78 7 0 24 Mar 2021