Online Planning with Lookahead Policies

10 September 2019

Papers citing "Online Planning with Lookahead Policies"

4 / 4 papers shown

Title
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies Yonathan Efroni Nadav Merlis Mohammad Ghavamzadeh Shie Mannor OffRL 78 68 0 27 May 2019
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes Aaron Sidford Mengdi Wang X. Wu Yinyu Ye 47 125 0 27 Oct 2017
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning Christoph Dann Tor Lattimore Emma Brunskill 60 307 0 22 Mar 2017
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes T. Dean R. Givan Sonia M. Leach 69 140 0 06 Feb 2013