This work studies interventions at four levels of group-policy RL pipelines---data, rollout, reward, and advantage---and conducts extensive RL training on saturated reasoning data only, demonstrating that don't waste your saturated data: with the right strategies they can be recycled into useful RL training signals in an increasingly data-scarce world.
Abstract
Group-relative reinforcement learning (RL) relies on reward variation among sampled responses to estimate informative relative advantages. As language models become increasingly capable, existing training data can become reward-saturated: all sampled responses to the same problem might receive equally high rewards, where the group-relative learning signals vanish and leave previously useful data obsolete. In this work, we investigate whether useful learning signals can be recovered from such saturated data. We study interventions at four levels of group-policy RL pipelines---data, rollout, reward, and advantage---and conduct extensive RL training on saturated reasoning data only. While standard GRPO on saturated data would almost always yield near-0 advantages and near-noise signals, diverse interventions successfully recycle and repurpose such data: among the proposed strategies, interventions at rollout generation are consistently most effective: nudging the policy to generate ``high-quality'', incorrect solutions introduces rollouts with poor rewards into saturated groups as negative samples, which turns out to improve GRPO by 6.4% to 9.0% across Qwen3-1.7B and 4B. Other interventions such as increasing rollout temperature or adding auxiliary rewards can also restore non-zero advantages, but yield less consistent gains. Further analyses show that effective negative rollouts require informative negative trajectories, that the method remains effective alongside unsaturated data, and that it supports iterative recycling of newly saturated examples. While increasingly stronger LLMs would render more data as saturated, our results demonstrate that don't waste your saturated data: with the right strategies they can be recycled into useful RL training signals in an increasingly data-scarce world.
GRAFT (Gated Replacement of Answer-Failed groups with peer Trajectories), an off-policy-aware framework that replaces all-fail groups with informative peer groups and transfers both successful and unsuccessful peer responses with peer-computed advantages, while controlling cross-model mismatch through sequence-level co...
Doohyuk Jang, Y. Park, Gyouk Chu et al.· arXiv.org· 0 citations
This work introduces Problem--Strategy Rollout Allocation (PSRA), which treats unguided and strategy-conditioned prompts as competing exploration arms and uses Bayesian sequential allocation to direct a fixed rollout budget toward arms most likely to yield informative, non-saturated groups.
Jin Cui, Xin-Yue Long, Bo-Ran Zhao et al.· arXiv.org· 1 citation
POLAR is presented, a difficulty-aware training framework that augments on-policy RL with conditional guidance from a larger reasoner that can turn otherwise wasted all-zero groups into targeted learning opportunities while keeping policy exploration on prompts the student can handle.
Ye Yuan, Zhi-Ping Xiao, Ming Zhang· Proceedings of the 35th ACM...· 0 citations
This work theoretically links flat reward RLVR to reduced distribution sharpening, and empirically shows improved sample diversity while maintaining single-attempt accuracy, in a method called \texttt{Flat}-RLVR that searches for flat reward regions via sharpness-aware minimization during LLM post-training, combining t...
Yeonbum Kim, Hyun Lee, Sung Whan Yoon· 0 citations
Reinforcement learning from verifiable rewards (RLVR) is limited by sparse outcome-level feedback on hard reasoning tasks: when all rollouts in a group fail, rewards provide no learning signal. Stronger teachers can provide additional guidance, but this raises a central question: how can such signals be incorporated in...
Zhi-Hao Yang, Bo-Yuan Zheng, Pu-Hui Tan et al.· 0 citations
Temperature-Grouped Reinforcement Learning (TGRL), which turns temperature-induced diversity into an explicit training signal, and reaches equivalent accuracy up to 36% faster than strong RLVR baselines without expanding the rollout budget.
Zi-Han Lin, Xiao-Han Wang, Jie Cao et al.· arXiv.org· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 17, 2026
By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.