Proximal Policy Optimization with Adaptive Exploration

Andrei Lixandru
5/7/2024
cs.LGcs.AI

No official code found. Best implementation: AndreiLix/axPPO (10 stars, MIT, last commit 2024-08-13).

Abstract

Proximal Policy Optimization with Adaptive Exploration (axPPO) is introduced as a novel learning algorithm. This paper investigates the exploration-exploitation tradeoff within the context of reinforcement learning and aims to contribute new insights into reinforcement learning algorithm design. The proposed adaptive exploration framework dynamically adjusts the exploration magnitude during training based on the recent performance of the agent. Our proposed method outperforms standard PPO algorithms in learning efficiency, particularly when significant exploratory behavior is needed at the beginning of the learning process.

View on arXivView PDF

Code Implementations(1)

AndreiLix/axPPOCommunity100%
MIT
101Jupyter NotebookDec 29, 20232 years agoMIT

Similar Papers

Cite this paper

@article{lixandru2024proximal,
  title  = {Proximal Policy Optimization with Adaptive Exploration},
  author = {Andrei Lixandru},
  year   = {2024},
  eprint = {2405.04664},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.04664v1}
}

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

Discussion