dorsal/arxiv
View SchemaOrchestrating Tokens and Sequences: Dynamic Hybrid Policy Optimization for RLVR
| Authors | Zijun Min, Bingshuai Liu, Ante Wang, Long Zhang, Anxiang Zeng, Haibo Zhang, Jinsong Su |
|---|---|
| Categories | |
| ArXiv ID | 2601.05607vv1 |
| URL | https://arxiv.org/abs/2601.05607 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Reinforcement Learning with Verifiable Rewards (RLVR) offers a promising framework for optimizing large language models in reasoning tasks. However, existing RLVR algorithms focus on different granularities, and each has complementary strengths and limitations. Group Relative Policy Optimization (GRPO) updates the policy with token-level importance ratios, which preserves fine-grained credit assignment but often suffers from high variance and instability. In contrast, Group Sequence Policy Optimization (GSPO) applies single sequence-level importance ratios across all tokens in a response that better matches sequence-level rewards, but sacrifices token-wise credit assignment. In this paper, we propose Dynamic Hybrid Policy Optimization (DHPO) to bridge GRPO and GSPO within a single clipped surrogate objective. DHPO combines token-level and sequence-level importance ratios using weighting mechanisms. We explore two variants of the mixing mechanism, including an averaged mixing and an entropy-guided mixing. To further stabilize training, we employ a branch-specific clipping strategy that constrains token-level and sequence-level ratios within separate trust regions before mixing, preventing outliers in either branch from dominating the update. Across seven challenging mathematical reasoning benchmarks, experiments on both dense and MoE models from the Qwen3 series show that DHPO consistently outperforms GRPO and GSPO. We will release our code upon acceptance of this paper.
{
"annotation_id": "390957c1-1b22-42d6-9020-fe05c04a96a1",
"date_created": "2026-02-17T05:53:05.014000Z",
"date_modified": "2026-02-17T05:53:05.014000Z",
"file_hash": "7777e1310148b06f019012a808e493d55bc4dd8cdace8e5e49b7f57c9c6e193c",
"private": false,
"record": {
"abstract": "Reinforcement Learning with Verifiable Rewards (RLVR) offers a promising framework for optimizing large language models in reasoning tasks. However, existing RLVR algorithms focus on different granularities, and each has complementary strengths and limitations. Group Relative Policy Optimization (GRPO) updates the policy with token-level importance ratios, which preserves fine-grained credit assignment but often suffers from high variance and instability. In contrast, Group Sequence Policy Optimization (GSPO) applies single sequence-level importance ratios across all tokens in a response that better matches sequence-level rewards, but sacrifices token-wise credit assignment. In this paper, we propose Dynamic Hybrid Policy Optimization (DHPO) to bridge GRPO and GSPO within a single clipped surrogate objective. DHPO combines token-level and sequence-level importance ratios using weighting mechanisms. We explore two variants of the mixing mechanism, including an averaged mixing and an entropy-guided mixing. To further stabilize training, we employ a branch-specific clipping strategy that constrains token-level and sequence-level ratios within separate trust regions before mixing, preventing outliers in either branch from dominating the update. Across seven challenging mathematical reasoning benchmarks, experiments on both dense and MoE models from the Qwen3 series show that DHPO consistently outperforms GRPO and GSPO. We will release our code upon acceptance of this paper.",
"arxiv_id": "2601.05607",
"authors": [
"Zijun Min",
"Bingshuai Liu",
"Ante Wang",
"Long Zhang",
"Anxiang Zeng",
"Haibo Zhang",
"Jinsong Su"
],
"categories": [
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Orchestrating Tokens and Sequences: Dynamic Hybrid Policy Optimization for RLVR",
"url": "https://arxiv.org/abs/2601.05607",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fa096fc0-501b-465f-9688-502bafaf620c",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}