Enhancing Policy Gradient with the Polyak Step-Size Adaption

Yunxiang Li, Rui Yuan, Chen Fan, Mark Schmidt, Samuel Horváth +2 more
4/11/2024
cs.LG

No confident code implementation found for this paper.

Abstract

Policy gradient is a widely utilized and foundational algorithm in the field of reinforcement learning (RL). Renowned for its convergence guarantees and stability compared to other RL algorithms, its practical application is often hindered by sensitivity to hyper-parameters, particularly the step-size. In this paper, we introduce the integration of the Polyak step-size in RL, which automatically adjusts the step-size without prior knowledge. To adapt this method to RL settings, we address several issues, including unknown f* in the Polyak step-size. Additionally, we showcase the performance of the Polyak step-size in RL through experiments, demonstrating faster convergence and the attainment of more stable policies.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{li2024enhancing,
  title  = {Enhancing Policy Gradient with the Polyak Step-Size Adaption},
  author = {Yunxiang Li and Rui Yuan and Chen Fan and Mark Schmidt and Samuel Horváth and Robert M. Gower and Martin Takáč},
  year   = {2024},
  eprint = {2404.07525},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.07525v1}
}

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

Discussion