Skip to Main content Skip to Navigation
New interface
Conference papers

Anderson acceleration for reinforcement learning

Abstract : Anderson (1965) acceleration is an old and simple method for accelerating the computation of a fixed point. However, as far as we know and quite surprisingly, it has never been applied to dynamic programming or reinforcement learning. In this paper, we explain briefly what Anderson acceleration is and how it can be applied to value iteration, this being supported by preliminary experiments showing a significant speed up of convergence, that we critically discuss. We also discuss how this idea could be applied more generally to (deep) reinforcement learning.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Bruno Scherrer Connect in order to contact the contributor
Submitted on : Tuesday, November 20, 2018 - 12:52:47 PM
Last modification on : Saturday, June 25, 2022 - 7:46:09 PM


Files produced by the author(s)


  • HAL Id : hal-01928142, version 1
  • ARXIV : 1809.09501



Matthieu Geist, Bruno Scherrer. Anderson acceleration for reinforcement learning. EWRL 2018 - 4th European workshop on Reinforcement Learning, Oct 2018, Lille, France. ⟨hal-01928142⟩



Record views


Files downloads