Preprint
Reinforcement Learning

Group Sequence Policy Optimization

Chujie Zheng, Shixuan Liu, Mingze Li, Xiong-Hui Chen, Bowen Yu, Chang Gao, K. Dang, Yuqiong Liu, Rui Men, An Yang, Jingren Zhou, Junyang Lin
July 24, 2025arXiv.org627 citations

627

Citations

58

Influential Citations

arXiv.org

Venue

2025

Year

Abstract

This paper introduces Group Sequence Policy Optimization (GSPO), our stable, efficient, and performant reinforcement learning algorithm for training large language models. Unlike previous algorithms that adopt token-level importance ratios, GSPO defines the importance ratio based on sequence likelihood and performs sequence-level clipping, rewarding, and optimization. We demonstrate that GSPO achieves superior training efficiency and performance compared to the GRPO algorithm, notably stabilizes Mixture-of-Experts (MoE) RL training, and has the potential for simplifying the design of RL infrastructure. These merits of GSPO have contributed to the remarkable improvements in the latest Qwen3 models.

Analysis

Why This Paper Matters

Reinforcement learning (RL) is crucial for aligning large language models (LLMs) with human preferences, but existing algorithms like GRPO rely on token-level importance ratios, which can be unstable and inefficient, especially for Mixture-of-Experts (MoE) models. GSPO addresses these issues by shifting to sequence-level importance ratios and clipping, offering a more stable and efficient training paradigm. This is significant because MoE models are increasingly popular for scaling LLMs, yet their RL training is notoriously unstable. GSPO's success in stabilizing MoE training and improving performance, as demonstrated in Qwen3, makes it a practical contribution with immediate industry relevance.

Technical Contributions

  • Sequence-level importance ratios: Instead of computing importance ratios per token, GSPO computes them based on the likelihood of the entire sequence, which reduces variance and improves stability.
  • Sequence-level clipping: Clipping is applied at the sequence level, preventing large updates from individual tokens and leading to more consistent policy updates.
  • Sequence-level rewarding: Rewards are assigned based on sequence-level likelihood, aligning the optimization objective with the final output quality.
  • Simplified infrastructure: By avoiding token-level operations, GSPO can simplify the RL training pipeline, reducing computational overhead and engineering complexity.

Results

The abstract reports that GSPO achieves superior training efficiency and performance compared to GRPO. Notably, it stabilizes MoE RL training, which is a significant achievement given the known challenges. The paper also highlights that GSPO contributed to the remarkable improvements in the latest Qwen3 models, indicating practical effectiveness. However, specific numerical metrics (e.g., reward scores, convergence rates) are not provided in the abstract, so a detailed quantitative comparison would require reading the full paper.

Significance

GSPO's sequence-level approach could become a new standard for RL training of LLMs, especially for MoE architectures. Its stability and efficiency benefits may accelerate the development of larger and more capable models. The simplification of RL infrastructure could lower the barrier for smaller labs to train aligned models. As RL continues to be a key component in post-training, GSPO's contributions are likely to influence both academic research and industrial practice, as evidenced by its adoption in Qwen3.