mlsanityData to 7 Oct 2026

Multiple-Step Greedy Policies in Online and Approximate Reinforcement Learning

arXiv 1805.07956 ↗First posted 21 May 2018cs.LG cs.AI stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

Multiple-step lookahead policies have demonstrated high empirical competence in Reinforcement Learning, via the use of Monte Carlo Tree Search or Model Predictive Control. In a recent work citeefroni2018beyond, multiple-step greedy policies and their use in vanilla Policy Iteration algorithms were proposed and analyzed. In this work, we study multiple-step greedy algorithms in more practical setups. We begin by highlighting a counter-intuitive difficulty, arising with soft-policy updates: even in the absence of approximations, and contrary to the 1-step-greedy case, monotonic policy improvement is not guaranteed unless the update stepsize is sufficiently large. Taking particular care about this difficulty, we formulate and analyze online and approximate algorithms that use such a multi-step greedy operator.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 3; 2023: 3.

7 papers.