Beyond Bradley-Terry Models: A General Preference Model for Language Model Alignment
Yifan Zhang, Ge Zhang, Yue Wu, Kangping Xu, Quanquan Gu
Abstract
Modeling human preferences is crucial for aligning foundation models with human values. Traditional reward modeling methods, such as the Bradley-Terry (BT) reward model, fall short in expressiveness, particularly in addressing intransitive preferences. In this paper, we introduce preference embedding, an approach that embeds responses into a latent space to capture intricate preference structures efficiently, achieving linear query complexity. Additionally, we propose preference score-based General Preference Optimization (GPO), which generalizes rewardbased reinforcement learning from human feedback (RLHF). Experimental results show that our General Preference embedding Model (GPM) consistently outperforms the BT reward model on the RewardBench benchmark and effectively models cyclic preferences where any BT reward model behaves like a random guess. Furthermore, evaluations on downstream tasks such as Al-pacaEval2.0, following the language model posttraining with GPO and our general preference model, reveal performance improvements over BT models. These findings indicate that our method may enhance the alignment of foundation models with nuanced human values. The code is available at https://github.com/general-preference/generalpreference-model .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6047a12b-cc6f-4d33-ad48-a2bfb34b6bf6Cited by top-tier papers8
- On the Design of KL-Regularized Policy Gradient Algorithms for LLM ReasoningYifan Zhang, Yifeng Liu, Rina Hughes, Yang Yuan et al.ICLR 2026 · 30 citations
- Ask a Strong LLM Judge when Your Reward Model is UncertainZhenghao Xu, Qin Lu, Qingru Zhang, Liang Qiu et al.NeurIPS 2025 · 14 citations
- Robust AI Evaluation through Maximal LotteriesHadi Khalaf, Serena Wang, Daniel Halpern, Itai Shapira et al.ICML 2026 · 2 citations
- What Does Preference Learning Recover from Pairwise Comparison Data?Rattana Pukdee, Nina Balcan, Pradeep RavikumarICML 2026 · 1 citation
- Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-SolvingQi Liu, Xinhao Zheng, Renqiu Xia, Xingzhi Qi et al.ICML 2026
Builds on13
- Learning Transferable Visual Models From Natural Language SupervisionAlec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh et al.ICML 2021 · 47,906 citations
- Training language models to follow instructions with human feedbackLong Ouyang, Jeffrey Wu, Xu Jiang, Diogo Almeida et al.NeurIPS 2022 · 24,707 citations
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Direct Preference Optimization: Your Language Model is Secretly a Reward ModelRafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D. Manning et al.NeurIPS 2023 · 10,924 citations
- Let's Verify Step by StepHunter Lightman, Vineet Kosaraju, Yuri Burda, Harrison Edwards et al.ICLR 2024 · 3,045 citations
Related papers
- Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret LearningYuheng Zhang, Dian Yu, Baolin Peng, Linfeng Song et al.ICLR 2025
- Transitivity Meets Cyclicity: Explicit Preference Decomposition for Dynamic Large Language Model AlignmentYucong Huang, Xiucheng Li, Kaiqi Zhao, Jing LiICML 2026
- Permutative Preference Alignment from Listwise Ranking of Human JudgmentsYang Zhao, Yixin Wang, Mingzhang YinEMNLP 2025 · 5 citations
- Greedy Sampling Is Provably Efficient For RLHFDi Wu, Chengshuai Shi, Jing Yang, Cong ShenNeurIPS 2025 · 11 citations
- IPO: Your Language Model is Secretly a Preference ClassifierShivank Garg, Ayush Singh, Shweta Singh, Paras ChopraACL 2025
