Anderson Acceleration for Reinforcement Learning

September 25, 2018 ยท Declared Dead ยท ๐Ÿ› European Workshop on Reinforcement Learning

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Matthieu Geist, Bruno Scherrer arXiv ID 1809.09501 Category cs.LG: Machine Learning Cross-listed stat.ML Citations 42 Venue European Workshop on Reinforcement Learning Last Checked 6 months ago
Abstract
Anderson 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted