Abstract:Group Relative Policy Optimization (GRPO) has become the dominant method for reinforcement learning with verifiable rewards in large language models, but it suffers from two critical limitations: gradient vanishing and diversity collapse. When training questions are too easy or too hard, all sampled responses receive identical rewards, yielding zero gradients. Meanwhile, the model tends to collapse its responses toward a single reasoning pattern rather than exploring diverse strategies. We propose Transformation-Augmented GRPO (TA-GRPO), a simple but effective method that addresses both issues via question rephrasing. For each training question, we automatically generate multiple problem-equivalent rephrasings that alter wording, format, and information order while preserving the underlying meaning. Because these rephrasings shift the model's perceived difficulty, pooling responses across the original and its rephrasings yields mixed rewards and more diverse reasoning paths. TA-GRPO jointly computes advantages over this expanded response set and aligns all importance ratios to the original question, enabling the model to learn from a richer set of solution attempts. Experiments on four LLMs (Qwen3-1.7B, Qwen3-4B, Llama-3.2-1B, Llama-3.2-3B) show that TA-GRPO consistently improves pass@$k$ on competition-level benchmarks (AMC, OlympiadBench, AIME24, AIME25) and out-of-distribution benchmarks (Minerva, GPQA-Diamond). Notably, it improves the average pass@32 of Qwen3-1.7B and Qwen3-4B by \textbf{4.97} and \textbf{4.34} points, respectively, and matches the exploration quality of baselines trained on up to 2.5$\times$ more data.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2601.22478 [cs.LG] |
| (or arXiv:2601.22478v5 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2601.22478 arXiv-issued DOI via DataCite |
From: Khiem Le [view email]
[v1]
Fri, 30 Jan 2026 02:43:29 UTC (380 KB)
[v2]
Wed, 11 Feb 2026 04:33:29 UTC (380 KB)
[v3]
Sat, 9 May 2026 03:16:59 UTC (3,902 KB)
[v4]
Sat, 16 May 2026 19:30:05 UTC (3,902 KB)
[v5]
Tue, 19 May 2026 01:38:31 UTC (3,902 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。