Reinforcement Pre-Training
Authors: Qingxiu Dong, Li Dong, Yao Tang, Tianzhu Ye, Yutao Sun, Zhifang Sui, Furu Wei
AI-generated Key Points
- The paper introduces Reinforcement Pre-Training (RPT) as a scaling paradigm for large language models and reinforcement learning (RL)
- RPT reframes next-token prediction as a reasoning task trained using RL techniques
- By incentivizing next-token reasoning capability, RPT significantly enhances accuracy in predicting subsequent tokens
- RPT can leverage vast amounts of text data for general-purpose RL applications without domain-specific annotated answers
- RPT establishes a robust pre-trained foundation that can be further fine-tuned through reinforcement learning methods
- Increased training compute consistently enhances the accuracy of next-token prediction according to scaling curves
- The empirical evidence solidifies RPT as an effective scaling paradigm for language model pre-training methodologies
- RPT enables more efficient and accurate language modeling tasks through reinforcement learning principles
Abstract: In this work, we introduce Reinforcement Pre-Training (RPT) as a new scaling paradigm for large language models and reinforcement learning (RL). Specifically, we reframe next-token prediction as a reasoning task trained using RL, where it receives verifiable rewards for correctly predicting the next token for a given context. RPT offers a scalable method to leverage vast amounts of text data for general-purpose RL, rather than relying on domain-specific annotated answers. By incentivizing the capability of next-token reasoning, RPT significantly improves the language modeling accuracy of predicting the next tokens. Moreover, RPT provides a strong pre-trained foundation for further reinforcement fine-tuning. The scaling curves show that increased training compute consistently improves the next-token prediction accuracy. The results position RPT as an effective and promising scaling paradigm to advance language model pre-training.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.