The Definitive Guide to Policy Gradients in Deep Reinforcement Learning: Theory, Algorithms and Implementations

Matthias Lehmann
1/24/2024
cs.LGcs.AI

Official code: Matt00n/PolicyGradientsJax (44 stars, MIT, last commit 2024-01-25).

Abstract

In recent years, various powerful policy gradient algorithms have been proposed in deep reinforcement learning. While all these algorithms build on the Policy Gradient Theorem, the specific design choices differ significantly across algorithms. We provide a holistic overview of on-policy policy gradient algorithms to facilitate the understanding of both their theoretical foundations and their practical implementations. In this overview, we include a detailed proof of the continuous version of the Policy Gradient Theorem, convergence results and a comprehensive discussion of practical algorithms. We compare the most prominent algorithms on continuous control environments and provide insights on the benefits of regularization. All code is available at https://github.com/Matt00n/PolicyGradientsJax.

View on arXivView PDF

Code Implementations(1)

MIT

On-Policy Policy Gradient Algorithms in JAX

442PythonNov 27, 20232 years agoMIT

Similar Papers

Cite this paper

@article{lehmann2024definitive,
  title  = {The Definitive Guide to Policy Gradients in Deep Reinforcement Learning: Theory, Algorithms and Implementations},
  author = {Matthias Lehmann},
  year   = {2024},
  eprint = {2401.13662},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.13662v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.13662.svg)](https://codeofpaper.com/paper/2401.13662)

Discussion