Reflective Policy Optimization

Yaozhong Gan, Renye Yan, Zhe Wu, Junliang Xing
2/12/2026

No official code found. Best implementation: Edgargan/RPO (6 stars, last commit 2024-05-31).

Abstract

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

View on arXivView PDF

Code Implementations(1)

Edgargan/RPOCommunity70%

Reflective Policy Optimization

60PythonMay 14, 20242 years ago

Similar Papers

Cite this paper

@article{gan2026reflective,
  title  = {Reflective Policy Optimization},
  author = {Yaozhong Gan and Renye Yan and Zhe Wu and Junliang Xing},
  year   = {2026},
  eprint = {2406.03678},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2406.03678},
  journal = {ICML 2024 2024}
}

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

Discussion