Accelerated Preference Optimization for Large Language Model Alignment
<|reference_start|>Accelerated Preference Optimization for Large Language Model Alignment: 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.<|reference_end|>
@article{he2024accelerated,
    title={Accelerated Preference Optimization for Large Language Model Alignment},
    author={Jiafan He, Huizhuo Yuan, Quanquan Gu},
    journal={arXiv preprint arXiv:2410.06293},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.06293},
    primaryClass={cs.LG cs.AI cs.CL}
}