Reflective Policy Optimization

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.

Cite

Text

Gan et al. "Reflective Policy Optimization." International Conference on Machine Learning, 2024.

Markdown

[Gan et al. "Reflective Policy Optimization." International Conference on Machine Learning, 2024.](https://mlanthology.org/icml/2024/gan2024icml-reflective/)

BibTeX

@inproceedings{gan2024icml-reflective,
  title     = {{Reflective Policy Optimization}},
  author    = {Gan, Yaozhong and Yan, Renye and Wu, Zhe and Xing, Junliang},
  booktitle = {International Conference on Machine Learning},
  year      = {2024},
  pages     = {14471-14490},
  volume    = {235},
  url       = {https://mlanthology.org/icml/2024/gan2024icml-reflective/}
}