Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity

6 June 2020

Papers citing "Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity"

13 / 13 papers shown

Title
Settling the Sample Complexity of Online Reinforcement Learning Zihan Zhang Yuxin Chen Jason D. Lee S. Du OffRL 167 23 0 25 Jul 2023
Almost Optimal Model-Free Reinforcement Learning via Reference-Advantage Decomposition Zihan Zhang Yuanshuo Zhou Xiangyang Ji OffRL 62 156 0 21 Apr 2020
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP Kefan Dong Yuanhao Wang Xiaoyu Chen Liwei Wang OffRL 57 95 0 27 Jan 2019
Policy Certificates: Towards Accountable Reinforcement Learning Christoph Dann Ashutosh Adhikari Wei Wei Jimmy J. Lin OffRL 110 144 0 07 Nov 2018
Is Q-learning Provably Efficient? Chi Jin Zeyuan Allen-Zhu Sébastien Bubeck Michael I. Jordan OffRL 63 806 0 10 Jul 2018
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes Aaron Sidford Mengdi Wang X. Wu Yinyu Ye 52 125 0 27 Oct 2017
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning Christoph Dann Tor Lattimore Emma Brunskill 72 309 0 22 Mar 2017
Minimax Regret Bounds for Reinforcement Learning M. G. Azar Ian Osband Rémi Munos 83 774 0 16 Mar 2017
Asynchronous Methods for Deep Reinforcement Learning Volodymyr Mnih Adria Puigdomenech Badia M. Berk Mirza Alex Graves Timothy Lillicrap Tim Harley David Silver Koray Kavukcuoglu 197 8,851 0 04 Feb 2016
Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning Christoph Dann Emma Brunskill 69 249 0 29 Oct 2015
Trust Region Policy Optimization John Schulman Sergey Levine Philipp Moritz Michael I. Jordan Pieter Abbeel 277 6,767 0 19 Feb 2015
On the Sample Complexity of Reinforcement Learning with a Generative Model M. G. Azar Rémi Munos H. Kappen 69 156 0 27 Jun 2012
PAC Bounds for Discounted MDPs Tor Lattimore Marcus Hutter 86 189 0 17 Feb 2012