ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
95
Citations
3
Influential Citations
arXiv.org
Venue
2025
Year
Group Relative Policy Optimization (GRPO) has significantly enhanced the reasoning capability of large language models by optimizing the arithmetic mean of token-level rewards. Unfortunately, GRPO is observed to suffer from unstable policy updates when facing tokens with outlier importance-weighted rewards, which manifest as extreme importance sampling ratios during training. In this study, we propose Geometric-Mean Policy Optimization (GMPO), with the aim to improve the stability of GRPO through suppressing token reward outliers. Instead of optimizing the arithmetic mean, GMPO maximizes the geometric mean of token-level rewards, which is inherently less sensitive to outliers and maintains a more stable range of importance sampling ratio. GMPO is plug-and-play-simply replacing GRPO's arithmetic mean with the geometric mean of token-level rewards, as the latter is inherently less sensitive to outliers. GMPO is theoretically plausible-analysis reveals that both GMPO and GRPO are weighted forms of the policy gradient while the former enjoys more stable weights, which consequently benefits policy optimization and performance. Experiments on multiple mathematical reasoning benchmarks show that GMPO-7B improves the average Pass@1 of GRPO by up to 4.1%, outperforming many state-of-the-art approaches. Code is available at https://github.com/callsys/GMPO.
Group Relative Policy Optimization (GRPO) has become a cornerstone for enhancing reasoning in large language models, but its reliance on arithmetic mean of token rewards makes it vulnerable to outlier importance-weighted rewards. These outliers cause unstable policy updates, hindering performance. This paper identifies a critical flaw in a widely used method and offers an elegant fix: replacing the arithmetic mean with the geometric mean. The geometric mean is inherently less sensitive to extreme values, leading to more stable training dynamics. This is particularly important for mathematical reasoning tasks where token-level reward signals can vary dramatically.
The work is timely as the AI community increasingly focuses on reasoning capabilities of LLMs. By providing a theoretically grounded and empirically validated improvement, GMPO addresses a practical pain point for practitioners fine-tuning models with reinforcement learning. The plug-and-play nature means it can be adopted with minimal code changes, lowering the barrier for adoption.
GMPO provides a simple yet powerful enhancement to GRPO that improves training stability and reasoning performance. Its theoretical grounding and empirical success suggest it could become a standard component in LLM fine-tuning pipelines. The approach is not limited to mathematical reasoning and could be applied to other domains where token-level rewards are used. By addressing a fundamental instability in policy optimization, GMPO contributes to more reliable and effective reinforcement learning for language models.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba