A Step Harder, Not a Step Too Far: The Benefits and Limits of Curriculum Difficulty Progression in GRPO
New in LLM reasoning; no direction yet. LLM reasoning
Abstract (arXiv)
Curriculum learning typically organizes training samples from easy to hard. In GRPO, medium-difficulty samples are attractive for online selection because they are more likely to yield informative group-relative learning signals, and prioritizing them can improve training efficiency. However, it remains unclear whether persistently selecting such samples also leads to the strongest final model performance, or whether training can benefit from progressing toward harder samples. Meanwhile, sample difficulty changes as the policy evolves, so fixed difficulty estimates can become misaligned with the current policy. We therefore re-estimate sample difficulty under the current policy and, inspired by the easy-to-hard principle of curriculum learning, design and evaluate a staged curriculum that progressively shifts the active difficulty band toward harder samples. Experiments on GSM8K show that persistent medium-difficulty selection does not achieve the strongest observed performance. Across three random seeds, progressing to a moderately harder difficulty band improves test accuracy to 0.6591 ± 0.0077, compared with 0.6449 ± 0.0024 for the fixed-medium curriculum. However, further progression to a harder difficulty band reduces accuracy to 0.6405 ± 0.0053. These results show that staged difficulty progression can outperform persistent medium-difficulty selection, but its benefit is non-monotonic. Effective GRPO curricula can therefore benefit from progressing beyond medium difficulty, while avoiding excessive progression toward overly difficult samples.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 28 references that are in the map. First posted on arXiv 9 Oct 2026.
Builds on
21 of 28 references.
References · 21
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2025Understanding R1-Zero-Like Training: A Critical Perspectivecited by 1,345
- 2025LIMR: Less is More for RL Scalingcited by 139
- 2025Online Difficulty Filtering for Reasoning Oriented Reinforcement Learningcited by 104
- 2025Efficient Reinforcement Finetuning via Adaptive Curriculum Learningcited by 93
- 2025Curriculum Reinforcement Learning from Easy to Hard Tasks Improves LLM Reasoningcited by 92
- 2025Improving Data Efficiency for LLM Reinforcement Fine-tuning Through Difficulty-targeted Online Data Selection and Rollout Replaycited by 56
- 2025Can Prompt Difficulty be Online Predicted for Accelerating RL Finetuning of Reasoning Models?cited by 52
- 2025No Prompt Left Behind: Exploiting Zero-Variance Prompts in LLM Reinforcement Learning via Entropy-Guided Advantage Shapingcited by 50
- 2025Prompt Curriculum Learning for Efficient LLM Post-Trainingcited by 45
9 more
- 2025AdaCuRL: Adaptive Curriculum Reinforcement Learning with Invalid Sample Mitigation and Historical Revisitingcited by 20
- 2025Towards High Data Efficiency in Reinforcement Learning with Verifiable Rewardcited by 19
- 2025CurES: From Gradient Analysis to Efficient Curriculum Learning for Reasoning LLMscited by 19
- 2025BOTS: A Unified Framework for Bayesian Online Task Selection in LLM Reinforcement Finetuningcited by 14
- 2025Scheduling Your LLM Reinforcement Learning with Reasoning Treescited by 12
- 2026Dynamics-Predictive Sampling for Active RL Finetuning of Large Reasoning Modelscited by 11
- 2026Prune as You Generate: Online Rollout Pruning for Faster and Better RLVRcited by 10
- 2025UFO-RL: Uncertainty-Focused Optimization for Efficient Reinforcement Learning Data Selectioncited by 6
- 2026Efficient RLVR Training via Weighted Mutual Information Data Selectioncited by 6
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Where to Start, How to Move: Analyzing Curricula under GRPO for Long-Horizon LLM Agents
- 2026Curriculum Group Policy Optimization: Adaptive Sampling for Unleashing the Potential of Text-to-Image Generation
- 2026Limits of Difficulty Scaling: Hard Samples Yield Diminishing Returns in GRPO-Tuned SLMs
- 2025Hard Examples Are All You Need: Maximizing GRPO Post-Training Under Annotation Budgets
- 2026Learning from Hard Prompts: Difficulty-aware Advantage Amplification in Dynamic Sampling
- 2021An Analytical Theory of Curriculum Learning in Teacher-Student Networks
- 2026Goldilocks RL: Tuning Task Difficulty to Escape Sparse Rewards for Reasoning
- 2026F-GRPO: Don't Let Your Policy Learn the Obvious and Forget the Rare