Group Policy Gradient

Junhua Chen, Zixi Zhang, Hantao Zhong, Rika Antonova
10/4/2025
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

We introduce Group Policy Gradient (GPG), a family of critic-free policy-gradient estimators for general MDPs. Inspired by the success of GRPO's approach in Reinforcement Learning from Human Feedback (RLHF), GPG replaces a learned value function with a group-based Monte Carlo advantage estimator, removing the memory, compute, and hyperparameter costs of training a critic while preserving PPO's clipped-objective structure. We prove the consistency of the GPG estimator, analyze the bias-variance tradeoffs, and demonstrate empirically that GPG matches or outperforms PPO on standard benchmarks. GPG makes better use of parallel simulations, which, together with its critic-free design, results in more efficient use of computational resources than PPO.

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!

Similar Papers

Cite this paper

@article{chen2025group,
  title  = {Group Policy Gradient},
  author = {Junhua Chen and Zixi Zhang and Hantao Zhong and Rika Antonova},
  year   = {2025},
  eprint = {2510.03679},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.03679v1}
}

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

Discussion