arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.03979cs.CL
收藏

基于似然的奖励设计用于通用大语言模型推理

Likelihood-Based Reward Designs for General LLM Reasoning

Meta FAIR;University of Amsterdam(阿姆斯特丹大学);New York University(纽约大学)

Ariel Kwiatkowski, Natasha Butt, Ismail Labiad, Julia Kempe, Yann Ollivier

AI总结:

本文提出基于对数概率的奖励设计,用于提升大语言模型在推理任务中的表现,尤其在可验证和不可验证场景中均表现出色。

摘要:

通过强化学习对大型语言模型(LLMs)进行微调,以在推理基准上进行训练,需要为每个基准设计一个特定的奖励函数,通常为二元奖励。这带来了两个潜在的限制:需要设计奖励以及二元奖励可能稀疏。在这里,我们系统地研究了从生成参考答案(或数据中存在的任何其他提示延续)的概率或对数概率导出的奖励,其优势在于不依赖特定验证器且可扩展。近年来,一些工作提倡使用类似的奖励(例如VeriFree、JEPO、RLPR、NOVER)。我们系统地比较了基于似然的奖励变体与标准基线,测试了在标准数学推理基准和长形式答案上的性能,其中没有外部验证器可用。我们发现,在所有设置中,使用参考答案的对数概率作为链式推理(CoT)学习的奖励是唯一表现良好的选项。这种奖励也与预训练期间使用的下一个令牌对数似然损失一致。在可验证的设置中,对数概率奖励带来的成功率与使用标准二元奖励强化相当,且产生更优的困惑度。在不可验证的设置中,它们与SFT表现相当。另一方面,基于概率的方法,如VeriFree,在不可验证的设置中由于正确答案的概率趋于消失而无法继续。总体而言,这确立了对数概率奖励作为CoT微调的可行方法,弥合了短、可验证和长、不可验证答案设置之间的鸿沟。

英文摘要:

Fine-tuning large language models (LLMs) on reasoning benchmarks via reinforcement learning requires a specific reward function, often binary, for each benchmark. This comes with two potential limitations: the need to design the reward, and the potentially sparse nature of binary rewards. Here, we systematically investigate rewards derived from the probability or log-probability of emitting the reference answer (or any other prompt continuation present in the data), which have the advantage of not relying on specific verifiers and being available at scale. Several recent works have advocated for the use of similar rewards (e.g., VeriFree, JEPO, RLPR, NOVER). We systematically compare variants of likelihood-based rewards with standard baselines, testing performance both on standard mathematical reasoning benchmarks, and on long-form answers where no external verifier is available. We find that using the log-probability of the reference answer as the reward for chain-of-thought (CoT) learning is the only option that performs well in all setups. This reward is also consistent with the next-token log-likelihood loss used during pretraining. In verifiable settings, log-probability rewards bring comparable or better success rates than reinforcing with standard binary rewards, and yield much better perplexity. In non-verifiable settings, they perform on par with SFT. On the other hand, methods based on probability, such as VeriFree, flatline on non-verifiable settings due to vanishing probabilities of getting the correct answer. Overall, this establishes log-probability rewards as a viable method for CoT fine-tuning, bridging the short, verifiable and long, non-verifiable answer settings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑