用自生成指令和投票机制,让大模型在数据少时也能自我提升推理能力。
SeRL: Self-Play Reinforcement Learning for Large Language Models with Limited Data
- 通过自生成指令和在线过滤,持续扩充高质量训练数据。
- 用多数投票法估算奖励,无需外部标注即可完成强化学习。
- 在少数据场景下性能媲美依赖优质标注的模型,适合资源受限领域。
近期研究证明强化学习能有效提升大语言模型的推理能力。但现有方法依赖高质量指令和可验证奖励,这两者在专业领域往往难以获取。本文提出自对弈强化学习(SeRL),在初始数据有限的情况下启动模型训练。SeRL包含两个互补模块:自指令生成模块在每轮训练中基于已有数据生成新指令,采用稳健的在线过滤策略保证指令质量、多样性和难度;自奖励模块引入简单的多数投票机制,为新增指令估算响应奖励,无需外部标注。最终,基于生成数据进行传统强化学习,实现迭代自对弈学习。在多个推理基准和不同模型架构上的实验表明,SeRL性能优于同类方法,且达到使用高质量数据与可验证奖励时的水平。代码已开源。
原文摘要 · Abstract (English)
Recent advances have demonstrated the effectiveness of Reinforcement Learning (RL) in improving the reasoning capabilities of Large Language Models (LLMs). However, existing works inevitably rely on high-quality instructions and verifiable rewards for effective training, both of which are often difficult to obtain in specialized domains. In this paper, we propose Self-play Reinforcement Learning (SeRL) to bootstrap LLM training with limited initial data. Specifically, SeRL comprises two complementary modules: self-instruction and self-rewarding. The former module generates additional instructions based on the available data at each training step, employing robust online filtering strategies to ensure instruction quality, diversity, and difficulty. The latter module introduces a simple yet effective majority-voting mechanism to estimate response rewards for additional instructions, eliminating the need for external annotations. Finally, SeRL performs conventional RL based on the generated data, facilitating iterative self-play learning. Extensive experiments on various reasoning benchmarks and across different LLM backbones demonstrate that the proposed SeRL yields results superior to its counterparts and achieves performance on par with those obtained by high-quality data with verifiable rewards. Our code is available at https://github.com/wantbook-book/SeRL.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。