用强化学习让大模型自动生成推理步骤,减少对人工标注数据依赖。
RL-STaR: Theoretical Analysis of Reinforcement Learning Frameworks for Self-Taught Reasoner
- 基于强化学习自动构造推理链,无需大量人工标注。
- 理论证明模型可逐步提升推理能力,且能容忍部分错误步骤。
- 为大模型推理训练提供理论支撑,适合研究者与工程落地者参考。
大语言模型的链式思维(CoT)提示能力使模型能分步解决复杂任务,但训练此类能力需要详尽的推理数据,这类数据常稀缺。自教推理框架(STaR)通过强化学习自动生成推理步骤,降低对人工标注数据的依赖。尽管STaR及其变体在实证中表现良好,其理论基础仍不明确。本文提供了理解强化学习在CoT推理及STaR中有效性的理论框架,包括:(1)启动有效推理改进所需的预训练模型质量标准;(2)策略改进分析,说明为何LLM推理能通过STaR迭代提升;(3)收敛至最优推理策略的条件;(4)鲁棒性分析,解释即使包含偶尔错误步骤,仍可改善推理。该框架旨在弥合实证发现与理论洞察之间的差距,推动大模型推理的强化学习方法发展。
原文摘要 · Abstract (English)
The reasoning abilities of large language models (LLMs) have improved with chain-of-thought (CoT) prompting, allowing models to solve complex tasks stepwise. However, training CoT capabilities requires detailed reasoning data, which is often scarce. The self-taught reasoner (STaR) framework addresses this by using reinforcement learning to automatically generate reasoning steps, reducing reliance on human-labeled data. Although STaR and its variants have demonstrated empirical success, a theoretical foundation explaining these improvements is lacking. This work provides a theoretical framework for understanding the effectiveness of reinforcement learning on CoT reasoning and STaR. Our contributions are: (1) criteria for the quality of pre-trained models necessary to initiate effective reasoning improvement; (2) an analysis of policy improvement, showing why LLM reasoning improves iteratively with STaR; (3) conditions for convergence to an optimal reasoning policy; and (4) an examination of STaR's robustness, explaining how it can improve reasoning even when incorporating occasional incorrect steps; This framework aims to bridge empirical findings with theoretical insights, advancing reinforcement learning approaches for reasoning in LLMs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。