A Provably Efficient Sample Collection Strategy for Reinforcement Learning

13 July 2020

Papers citing "A Provably Efficient Sample Collection Strategy for Reinforcement Learning"

21 / 21 papers shown

Title
Improved Sample Complexity for Incremental Autonomous Exploration in MDPs Jean Tarbouriech Matteo Pirotta Michal Valko A. Lazaric 48 13 0 29 Dec 2020
Fast active learning for pure exploration in reinforcement learning Pierre Ménard O. D. Domingues Anders Jonsson E. Kaufmann Edouard Leurent Michal Valko 40 95 0 27 Jul 2020
Improved Analysis of UCRL2 with Empirical Bernstein Inequality Ronan Fruit Matteo Pirotta A. Lazaric 27 31 0 10 Jul 2020
Adaptive Reward-Free Exploration E. Kaufmann Pierre Ménard O. D. Domingues Anders Jonsson Edouard Leurent Michal Valko 48 81 0 11 Jun 2020
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model Gen Li Yuting Wei Yuejie Chi Yuxin Chen 88 128 0 26 May 2020
Active Model Estimation in Markov Decision Processes Jean Tarbouriech S. Shekhar Matteo Pirotta Mohammad Ghavamzadeh A. Lazaric 43 24 0 06 Mar 2020
Near-optimal Regret Bounds for Stochastic Shortest Path Alon Cohen Haim Kaplan Yishay Mansour Aviv A. Rosenberg 50 55 0 23 Feb 2020
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes Chen-Yu Wei Mehdi Jafarnia-Jahromi Haipeng Luo Hiteshi Sharma R. Jain 121 105 0 15 Oct 2019
Regret Minimization for Reinforcement Learning by Evaluating the Optimal Bias Function Zihan Zhang Xiangyang Ji 50 71 0 12 Jun 2019
Model-Based Reinforcement Learning with a Generative Model is Minimax Optimal Alekh Agarwal Sham Kakade Lin F. Yang OffRL 81 170 0 10 Jun 2019
Skew-Fit: State-Covering Self-Supervised Reinforcement Learning Vitchyr H. Pong Murtaza Dalal Steven Lin Ashvin Nair Shikhar Bahl Sergey Levine OffRL SSL 69 276 0 08 Mar 2019
Active Exploration in Markov Decision Processes Jean Tarbouriech A. Lazaric 42 50 0 28 Feb 2019
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP Kefan Dong Yuanhao Wang Xiaoyu Chen Liwei Wang OffRL 52 95 0 27 Jan 2019
Provably efficient RL with Rich Observations via Latent State Decoding S. Du A. Krishnamurthy Nan Jiang Alekh Agarwal Miroslav Dudík John Langford OffRL 60 230 0 25 Jan 2019
Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds Andrea Zanette Emma Brunskill OffRL 95 275 0 01 Jan 2019
Regret Bounds for Reinforcement Learning via Markov Chain Concentration R. Ortner 58 46 0 06 Aug 2018
Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems Mengdi Wang 117 69 0 17 Oct 2017
Mixing time estimation in reversible Markov chains from a single sample path Daniel J. Hsu A. Kontorovich D. A. Levin Yuval Peres Csaba Szepesvári 62 83 0 24 Aug 2017
Automatic Goal Generation for Reinforcement Learning Agents Carlos Florensa David Held Xinyang Geng Pieter Abbeel 102 513 0 17 May 2017
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 156 1,025 0 16 Jul 2014
$Bandits with Switching Costs: T^{2/3} Regret$ Bandits with Switching Costs: T^{2/3} Regret O. Dekel Jian Ding Tomer Koren Yuval Peres 73 98 0 11 Oct 2013