Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model

26 May 2020

Papers citing "Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model"

37 / 37 papers shown

Title
Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints Max Buckley Konstantinos Papathanasiou Andreas Spanopoulos 50 0 0 09 Mar 2025
A Survey of Reinforcement Learning for Optimization in Automation Ahmad Farooq Kamran Iqbal OffRL 89 1 0 13 Feb 2025
Span-Based Optimal Sample Complexity for Average Reward MDPs M. Zurek Yudong Chen 33 6 0 22 Nov 2023
Distributionally Robust Model-based Reinforcement Learning with Large State Spaces Shyam Sundhar Ramesh Pier Giuseppe Sessa Yifan Hu Andreas Krause Ilija Bogunovic OOD 42 10 0 05 Sep 2023
Settling the Sample Complexity of Online Reinforcement Learning Zihan Zhang Yuxin Chen Jason D. Lee S. Du OffRL 95 21 0 25 Jul 2023
High-probability sample complexities for policy evaluation with linear function approximation Gen Li Weichen Wu Yuejie Chi Cong Ma Alessandro Rinaldo Yuting Wei OffRL 25 6 0 30 May 2023
Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time Xiang Ji Gen Li OffRL 32 7 0 24 May 2023
Local Optimization Achieves Global Optimality in Multi-Agent Reinforcement Learning Yulai Zhao Zhuoran Yang Zhaoran Wang Jason D. Lee 40 3 0 08 May 2023
A New Policy Iteration Algorithm For Reinforcement Learning in Zero-Sum Markov Games Anna Winnicki R. Srikant 34 1 0 17 Mar 2023
Improved Sample Complexity Bounds for Distributionally Robust Reinforcement Learning Zaiyan Xu Kishan Panaganti D. Kalathil OOD OffRL 29 30 0 05 Mar 2023
A Finite Sample Complexity Bound for Distributionally Robust Q-learning Shengbo Wang Nian Si Jose H. Blanchet Zhengyuan Zhou OOD OffRL 32 22 0 26 Feb 2023
Provably Efficient Reinforcement Learning via Surprise Bound Hanlin Zhu Ruosong Wang Jason D. Lee OffRL 20 5 0 22 Feb 2023
Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP Jinghan Wang Meng-Xian Wang Lin F. Yang 29 15 0 01 Dec 2022
When to Update Your Model: Constrained Model-based Reinforcement Learning Tianying Ji Yu-Juan Luo Gang Hua Mingxuan Jing Fengxiang He Wen-bing Huang 16 18 0 15 Oct 2022
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model Gen Li Yuejie Chi Yuting Wei Yuxin Chen 32 18 0 22 Aug 2022
Best Policy Identification in Linear MDPs Jerome Taupin Yassir Jedra Alexandre Proutière 36 3 0 11 Aug 2022
Near-Optimal Sample Complexity Bounds for Constrained MDPs Sharan Vaswani Lin F. Yang Csaba Szepesvári 29 32 0 13 Jun 2022
Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games Yuling Yan Gen Li Yuxin Chen Jianqing Fan OffRL 23 10 0 08 Jun 2022
The Efficacy of Pessimism in Asynchronous Q-Learning Yuling Yan Gen Li Yuxin Chen Jianqing Fan OffRL 75 40 0 14 Mar 2022
A Statistical Analysis of Polyak-Ruppert Averaged Q-learning Xiang Li Wenhao Yang Jiadong Liang Zhihua Zhang Michael I. Jordan 37 15 0 29 Dec 2021
Accelerated and instance-optimal policy evaluation with linear function approximation Tianjiao Li Guanghui Lan A. Pananjady OffRL 37 13 0 24 Dec 2021
Quantum Algorithms for Reinforcement Learning with a Generative Model Daochen Wang Aarthi Sundaram Robin Kothari Ashish Kapoor M. Rötteler 29 26 0 15 Dec 2021
Recent Advances in Reinforcement Learning in Finance B. Hambly Renyuan Xu Huining Yang OffRL 27 166 0 08 Dec 2021
Sample Complexity of Robust Reinforcement Learning with a Generative Model Kishan Panaganti D. Kalathil 93 69 0 02 Dec 2021
Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning Yuanzhi Li Ruosong Wang Lin F. Yang 15 20 0 01 Nov 2021
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning Gen Li Laixi Shi Yuxin Chen Yuejie Chi OffRL 42 50 0 09 Oct 2021
Robustness and sample complexity of model-based MARL for general-sum Markov games Jayakumar Subramanian Amit Sinha Aditya Mahajan 27 8 0 05 Oct 2021
Efficient Local Planning with Linear Function Approximation Dong Yin Botao Hao Yasin Abbasi-Yadkori N. Lazić Csaba Szepesvári 32 19 0 12 Aug 2021
Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting Gen Li Yuxin Chen Yuejie Chi Yuantao Gu Yuting Wei OffRL 24 28 0 17 May 2021
Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings Ming Yin Yu-Xiang Wang OffRL 29 19 0 13 May 2021
Nearly Horizon-Free Offline Reinforcement Learning Tongzheng Ren Jialian Li Bo Dai S. Du Sujay Sanghavi OffRL 16 49 0 25 Mar 2021
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis Gen Li Changxiao Cai Ee Yuting Wei Yuejie Chi OffRL 37 75 0 12 Feb 2021
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP Zihan Zhang Jiaqi Yang Xiangyang Ji S. Du 68 36 0 29 Jan 2021
Spectral Methods for Data Science: A Statistical Perspective Yuxin Chen Yuejie Chi Jianqing Fan Cong Ma 34 165 0 15 Dec 2020
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL Andrea Zanette OffRL 21 71 0 14 Dec 2020
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity Kaipeng Zhang Sham Kakade Tamer Bacsar Lin F. Yang 47 119 0 15 Jul 2020
$Q$ -learning with Logarithmic Regret Kunhe Yang Lin F. Yang S. Du 35 59 0 16 Jun 2020