Towards Tight Bounds on the Sample Complexity of Average-reward MDPs

13 June 2021

Papers citing "Towards Tight Bounds on the Sample Complexity of Average-reward MDPs"

7 / 7 papers shown

Title
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning Mario Bravo Juan Pablo Contreras 76 4 0 19 Mar 2024
Efficiently Solving MDPs with Stochastic Mirror Descent Yujia Jin Aaron Sidford 54 71 0 28 Aug 2020
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model Gen Li Yuting Wei Yuejie Chi Yuxin Chen 99 129 0 26 May 2020
Model-Based Reinforcement Learning with a Generative Model is Minimax Optimal Alekh Agarwal Sham Kakade Lin F. Yang OffRL 89 172 0 10 Jun 2019
Regret Bounds for Reinforcement Learning via Markov Chain Concentration R. Ortner 67 46 0 06 Aug 2018
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes Aaron Sidford Mengdi Wang X. Wu Yinyu Ye 56 127 0 27 Oct 2017
Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems Mengdi Wang 147 70 0 17 Oct 2017