Preference Ranking Optimization for Human Alignment

Feifan Song, Bowen Yu, Minghao Li, Haiyang Yu, Fei Huang +2 more
6/30/2023
cs.CLcs.AI

No official code found. Best implementation: AlibabaResearch/DAMO-ConvAI (1,602 stars, MIT, last commit 2026-01-22).

Abstract

Large language models (LLMs) often contain misleading content, emphasizing the need to align them with human values to ensure secure AI systems. Reinforcement learning from human feedback (RLHF) has been employed to achieve this alignment. However, it encompasses two main drawbacks: (1) RLHF exhibits complexity, instability, and sensitivity to hyperparameters in contrast to SFT. (2) Despite massive trial-and-error, multiple sampling is reduced to pair-wise contrast, thus lacking contrasts from a macro perspective. In this paper, we propose Preference Ranking Optimization (PRO) as an efficient SFT algorithm to directly fine-tune LLMs for human alignment. PRO extends the pair-wise contrast to accommodate preference rankings of any length. By iteratively contrasting candidates, PRO instructs the LLM to prioritize the best response while progressively ranking the rest responses. In this manner, PRO effectively transforms human alignment into aligning the probability ranking of n responses generated by LLM with the preference ranking of humans towards these responses. Experiments have shown that PRO outperforms baseline algorithms, achieving comparable results to ChatGPT and human responses through automatic-based, reward-based, GPT-4, and human evaluations.

View on arXivView PDF

Code Implementations(1)

MIT

DAMO-ConvAI: The official repository which contains the codebase for Alibaba DAMO Conversational AI.

1,602252CSS, MDXJul 15, 20229 months agoMIT
conversational-aideep-learningdialognatural-language-processing

Cite this paper

@article{song2023preference,
  title  = {Preference Ranking Optimization for Human Alignment},
  author = {Feifan Song and Bowen Yu and Minghao Li and Haiyang Yu and Fei Huang and Yongbin Li and Houfeng Wang},
  year   = {2023},
  eprint = {2306.17492},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.17492v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.17492.svg)](https://codeofpaper.com/paper/2306.17492)

Discussion