Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning

14 April 2023

Papers citing "Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning"

6 / 6 papers shown

Title
Settling the Sample Complexity of Online Reinforcement Learning Zihan Zhang Yuxin Chen Jason D. Lee S. Du OffRL 76 21 0 25 Jul 2023
Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation Dan Qiao Yu-Xiang Wang OffRL 38 11 0 03 Oct 2022
Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-free RL Ruiquan Huang J. Yang Yingbin Liang OffRL 35 8 0 28 Jun 2022
UCB Momentum Q-learning: Correcting the bias without forgetting Pierre Menard O. D. Domingues Xuedong Shang Michal Valko 50 35 0 01 Mar 2021
Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems Sergey Levine Aviral Kumar George Tucker Justin Fu OffRL GP 311 1,662 0 04 May 2020
Reward-Free Exploration for Reinforcement Learning Chi Jin A. Krishnamurthy Max Simchowitz Tiancheng Yu OffRL 82 181 0 07 Feb 2020