ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
24
Citations
3
Influential Citations
arXiv.org
Venue
2025
Year
Reinforcement learning with verifiable rewards (RLVR) improves language model reasoning by using rule-based rewards in verifiable domains such as mathematics and code. However, RLVR leads to limited generalization for open-ended tasks -- such as writing outline essays or making meal plans -- where humans reason routinely. This paper shows that the RLVR paradigm is effective beyond verifiable domains, and introduces **RL** with **M**odel-rewarded **T**hinking (**RLMT**) for general-purpose chat capabilities. Using diverse real-world prompts, RLMT requires LMs to generate long CoT reasoning before response, and optimizes them with online RL against a preference-based reward model used in RLHF. Across 40 training runs on Llama-3.1-8B and Qwen-2.5-7B (both base and instruct) and multiple optimization algorithms (DPO, PPO, and GRPO), RLMT consistently outperforms standard RLHF pipelines. This includes substantial gains of 3-7 points on three chat benchmarks (AlpacaEval2, WildBench, and ArenaHardV2), along with 1-3 point improvements on other tasks like creative writing and general knowledge. Our best 8B model surpasses GPT-4o in chat and creative writing and rivals Claude-3.7-Sonnet (Thinking). RLMT can also be applied directly to base models without an SFT stage, akin to R1-Zero training. Remarkably, with only 7K prompts, Llama-3.1-8B base trained with our RLMT recipe outperforms Llama-3.1-8B-Instruct post-trained with a complex multi-staged pipeline with 25M+ examples. We close with qualitative and quantitative analyses of how trained models plan their responses. Our results rethink the post-training pipeline and call upon future work to understand and employ thinking more broadly.
This paper addresses a critical gap in reinforcement learning for language models: while RLVR has shown remarkable success in verifiable domains like math and code, its application to open-ended chat tasks has been limited. The authors demonstrate that by requiring models to generate long chain-of-thought reasoning before responding, RLVR can be effectively extended to general-purpose chat, creative writing, and knowledge tasks. This is significant because it suggests that the benefits of RL-based reasoning training are not confined to narrow, verifiable domains but can improve a wide range of language model capabilities.
The work also challenges the conventional post-training pipeline. The finding that RLMT applied to a base model with only 7K prompts can outperform a complex multi-stage pipeline trained on 25M+ examples is striking. It implies that the quality and structure of training data (i.e., requiring thinking) may matter more than sheer quantity, which has practical implications for reducing the cost and complexity of model alignment.
This work has the potential to reshape how language models are aligned for general-purpose use. By demonstrating that thinking before responding can be trained via RL for open-ended tasks, it opens up new avenues for improving model quality without relying on massive supervised datasets. The finding that base models can be directly trained with RLMT to surpass instruct-tuned models suggests that the current multi-stage post-training pipeline may be unnecessarily complex. This could lead to more efficient and effective training recipes for future models, reducing both computational cost and data requirements. The qualitative analysis of planning behavior also provides a foundation for future research into understanding and improving model reasoning in conversational contexts.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba