Near-Optimal Randomized Exploration for Tabular Markov Decision
Processes

Near-Optimal Randomized Exploration for Tabular Markov Decision Processes

19 February 2021

Qiwen Cui

Papers citing "Near-Optimal Randomized Exploration for Tabular Markov Decision Processes"

5 / 5 papers shown

Title
Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback Asaf B. Cassel Haipeng Luo Aviv A. Rosenberg Dmitry Sotnikov OffRL 33 3 0 13 May 2024
Settling the Sample Complexity of Online Reinforcement Learning Zihan Zhang Yuxin Chen Jason D. Lee S. Du OffRL 98 22 0 25 Jul 2023
Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo Haque Ishfaq Qingfeng Lan Pan Xu A. R. Mahmood Doina Precup Anima Anandkumar Kamyar Azizzadenesheli BDL OffRL 30 20 0 29 May 2023
UCB Momentum Q-learning: Correcting the bias without forgetting Pierre Menard O. D. Domingues Xuedong Shang Michal Valko 79 41 0 01 Mar 2021
Improved Worst-Case Regret Bounds for Randomized Least-Squares Value Iteration Priyank Agrawal Jinglin Chen Nan Jiang 30 18 0 23 Oct 2020