Improving LLM General Preference Alignment via Optimistic Online Mirror Descent

Reinforcement learning from human feedback (RLHF) has demonstrated remarkable effectiveness in aligning large language models (LLMs) with human preferences. Many existing alignment approaches rely on the Bradley-Terry (BT) model assumption, which assumes the existence of a ground-truth reward for each prompt-response pair. However, this assumption can be overly restrictive when modeling complex human preferences. In this paper, we drop the BT model assumption and study LLM alignment under general preferences, formulated as a two-player game. Drawing on theoretical insights from learning in games, we integrate optimistic online mirror descent into our alignment framework to approximate the Nash policy. Theoretically, we demonstrate that our approach achieves an $\mathcal{O}(T^{-1})$ bound on the duality gap, improving upon the previous $\mathcal{O}(T^{-1/2})$ result. Meanwhile, it enjoys a linear convergence rate in the last iterate, a property not achieved by previous methods. More importantly, we implement our method and show through experiments that it outperforms state-of-the-art RLHF algorithms across multiple representative benchmarks.

Authors

• Yuheng Zhang
• Dian Yu Tencent AI Lab, Bellevue, WA
• Tao Ge
• Linfeng Song Tencent AI Lab, Bellevue, WA
• Zhichen Zeng University of Illinois at Urbana-Champaign
• Haitao Mi Tencent AI Lab, Bellevue, WA
• Nan Jiang Department of Computer Science, Purdue University
• Dong Yu Tencent AI Lab, Bellevue, WA

Keywords

No keywords are indexed for this paper.