Gradient Informed Proximal Policy Optimization

Sanghyun Son, L. Zheng, R. Sullivan, Yi-Ling Qiao, Ming C. Lin
12/1/2023

No official code found. Best implementation: SonSang/gippo (27 stars, last commit 2023-12-18).

Abstract

We introduce a novel policy learning method that integrates analytical gradients from differentiable environments with the Proximal Policy Optimization (PPO) algorithm. To incorporate analytical gradients into the PPO framework, we introduce the concept of an {\alpha}-policy that stands as a locally superior policy. By adaptively modifying the {\alpha} value, we can effectively manage the influence of analytical policy gradients during learning. To this end, we suggest metrics for assessing the variance and bias of analytical gradients, reducing dependence on these gradients when high variance or bias is detected. Our proposed approach outperforms baseline algorithms in various scenarios, such as function optimization, physics simulations, and traffic control environments. Our code can be found online: https://github.com/SonSang/gippo.

View on arXivView PDF

Code Implementations(1)

SonSang/gippoCommunity100%

Code for Paper "Gradient Informed Proximal Policy Optimization" (NeurIPS 2023)

272Shell, PythonOct 28, 20232 years ago

Similar Papers

Cite this paper

@article{son2023gradient,
  title  = {Gradient Informed Proximal Policy Optimization},
  author = {Sanghyun Son and L. Zheng and R. Sullivan and Yi-Ling Qiao and Ming C. Lin},
  year   = {2023},
  eprint = {2312.08710},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2312.08710},
  journal = {NEURIPS 2023 2023}
}

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/2312.08710.svg)](https://codeofpaper.com/paper/2312.08710)

Discussion