Adaptive Group Policy Optimization: Towards Stable Training and Token-Efficient Reasoning

Chen Li, Nazhou Liu, Kai Yang
3/20/2025
cs.CL

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Since DeepSeek-R1 popularized, Group Relative Policy Optimization (GRPO) has become the core part of training Reasoning LLMs. However, we find some deficiency that influences RL stability and inference efficiency, like zero-variance in advantage estimation. Thus, we propose Adaptive Group Policy Optimization (AGPO) which uses a simple but effective method, an adaptive loss function, to mitigate training fluctuation and token inefficiency. The experiments demonstrate our method achieves more stable training and superior performance with significantly fewer tokens in reasoning steps.

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. 1 weaker match is hidden by default — 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{li2025adaptive,
  title  = {Adaptive Group Policy Optimization: Towards Stable Training and Token-Efficient Reasoning},
  author = {Chen Li and Nazhou Liu and Kai Yang},
  year   = {2025},
  eprint = {2503.15952},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.15952v3}
}

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

Discussion