arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.06293cs.LGcs.AIcs.CL
收藏

面向大语言模型对齐的加速偏好优化

Accelerated Preference Optimization for Large Language Model Alignment

University of California, Los Angeles(加利福尼亚大学洛杉矶分校)

Jiafan He, Huizhuo Yuan, Quanquan Gu

AI总结:

该研究针对大语言模型对齐的RLHF效率问题,提出基于Nesterov动量的通用加速偏好优化框架APO,理论上证明其收敛更快,实验中在AlpacaEval 2.0基准上优于DPO等基线方法。

摘要:

基于人类反馈的强化学习(Reinforcement Learning from Human Feedback, RLHF)已成为实现大语言模型(large language models, LLMs)与人类偏好对齐的核心工具。直接偏好优化(Direct Preference Optimization, DPO)作为最主流的方法之一,将RLHF建模为策略优化问题,无需显式估计奖励函数。它解决了两步法的稳定性与效率问题,这类方法通常先估计奖励函数,再通过近端策略优化(proximal policy optimization, PPO)优化策略。由于RLHF本质上是一个优化问题,且动量技术在理论和实证上均能加速优化,一个自然的问题随之产生:动量能否加速RLHF?本文给出了肯定的答案。具体而言,我们首先证明迭代偏好优化方法可被视为一种近端点方法。基于这一观察,我们提出了通用的加速偏好优化(Accelerated Preference Optimization, APO)框架,该框架统一了多种现有偏好优化算法,并采用Nesterov动量技术加快LLM的对齐速度。理论上,我们证明APO相比标准迭代偏好优化方法(包括DPO和自博弈偏好优化(Self-Play Preference Optimization, SPPO))能实现更快的收敛速度。实验上,我们在AlpacaEval 2.0基准上验证了APO在RLHF任务中优于DPO、迭代DPO及其他强基线方法。

英文摘要:

Reinforcement Learning from Human Feedback (RLHF) has emerged as a pivotal tool for aligning large language models (LLMs) with human preferences. Direct Preference Optimization (DPO), one of the most popular approaches, formulates RLHF as a policy optimization problem without explicitly estimating the reward function. It overcomes the stability and efficiency issues of two-step approaches, which typically involve first estimating the reward function and then optimizing the policy via proximal policy optimization (PPO). Since RLHF is essentially an optimization problem, and it is well-known that momentum techniques can accelerate optimization both theoretically and empirically, a natural question arises: Can RLHF be accelerated by momentum? This paper answers this question in the affirmative. In detail, we first show that the iterative preference optimization method can be viewed as a proximal point method. Based on this observation, we propose a general Accelerated Preference Optimization (APO) framework, which unifies many existing preference optimization algorithms and employs Nesterov's momentum technique to speed up the alignment of LLMs. Theoretically, we demonstrate that APO can achieve a faster convergence rate than the standard iterative preference optimization methods, including DPO and Self-Play Preference Optimization (SPPO). Empirically, we show the superiority of APO over DPO, iterative DPO, and other strong baselines for RLHF on the AlpacaEval 2.0 benchmark.

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

↑