ResearchTrend.AI
Online Planning with Lookahead Policies
v1v2 (latest)

Online Planning with Lookahead Policies

Yonathan Efroni
Mohammad Ghavamzadeh
Shie Mannor
ArXiv (abs)PDFHTML

Papers citing "Online Planning with Lookahead Policies"

6 / 6 papers shown
Title
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies
Yonathan Efroni
Nadav Merlis
Mohammad Ghavamzadeh
Shie Mannor
OffRL
109
68
0
27 May 2019
How to Combine Tree-Search Methods in Reinforcement Learning
How to Combine Tree-Search Methods in Reinforcement Learning
Yonathan Efroni
Gal Dalal
B. Scherrer
Shie Mannor
58
32
0
06 Sep 2018
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
Aaron Sidford
Mengdi Wang
X. Wu
Yinyu Ye
80
128
0
27 Oct 2017
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning
Christoph Dann
Tor Lattimore
Emma Brunskill
83
311
0
22 Mar 2017
Near Optimal Behavior via Approximate State Abstraction
Near Optimal Behavior via Approximate State Abstraction
David Abel
D Ellis Hershkowitz
Michael L. Littman
OffRL
83
165
0
15 Jan 2017
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes
T. Dean
R. Givan
Sonia M. Leach
90
140
0
06 Feb 2013

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.