Foundational Lemmas for Bellman Optimality and Anti-Optimality Operators
by AnchoringJanuary 15th, 2025
Too Long; Didn't Read
These foundational lemmas establish key properties of Bellman optimality and anti-optimality operators, with insights into their fixed points and convergence in reinforcement learning.
Authors:
(1) Jongmin Lee, Department of Mathematical Science, Seoul National University;
(2) Ernest K. Ryu, Department of Mathematical Science, Seoul National University and Interdisciplinary Program in Artificial Intelligence, Seoul National University.
1.1 Notations and preliminaries
2.1 Accelerated rate for Bellman consistency operator
2.2 Accelerated rate for Bellman optimality opera
5 Approximate Anchored Value Iteration
6 Gauss–Seidel Anchored Value Iteration
7 Conclusion, Acknowledgments and Disclosure of Funding and References
A Preliminaries
For notational unity, we use the symbol U when both V and Q can be used.
This paper is available on arxiv under CC BY 4.0 DEED license.
L O A D I N G
. . . comments & more!
. . . comments & more!
