mlsanityData to 7 Oct 2026

Anderson Acceleration for Reinforcement Learning

arXiv 1809.09501 ↗First posted 25 Sep 2018cs.LG stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

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.

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

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 1; 2023: 6; 2024: 2; 2025: 2; 2026: 1.

14 papers.

Sort: