Beyond Scalar Reward Model: Learning Generative Judge from Preference Data

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ye, Ziyi, Li, Xiangsheng, Li, Qiuchi, Ai, Qingyao, Zhou, Yujia, Shen, Wei, Yan, Dong, Liu, Yiqun
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909760409829376
author Ye, Ziyi
Li, Xiangsheng
Li, Qiuchi
Ai, Qingyao
Zhou, Yujia
Shen, Wei
Yan, Dong
Liu, Yiqun
author_facet Ye, Ziyi
Li, Xiangsheng
Li, Qiuchi
Ai, Qingyao
Zhou, Yujia
Shen, Wei
Yan, Dong
Liu, Yiqun
contents Learning from preference feedback is a common practice for aligning large language models~(LLMs) with human value. Conventionally, preference data is learned and encoded into a scalar reward model that connects a value head with an LLM to produce a scalar score as preference or reward. However, scalar models lack interpretability and are known to be susceptible to biases in datasets. This paper investigates leveraging the generation capability of LLMs to address both limitations in one shot. Specifically, we prompt the pre-trained LLM to generate positive and negative judgments, both supported with rationales in natural language form. The self-generated contrastive judgment pairs are used to train the generative judge with Direct Preference Optimization (DPO). This proposal of training the generative Judge using self-generated Contrastive judgments (Con-J) ensures natural interpretability due to the generated rationales together with the judgments, as well as high robustness against bias without the need for an additional reward head. Experimental results show that the performance of Con-J is comparable to the scalar reward model trained on the same collection of preference data, and demonstrate its superior interpretability and robustness in encoding human preferences.
format Preprint
id arxiv_https___arxiv_org_abs_2410_03742
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Beyond Scalar Reward Model: Learning Generative Judge from Preference Data
Ye, Ziyi
Li, Xiangsheng
Li, Qiuchi
Ai, Qingyao
Zhou, Yujia
Shen, Wei
Yan, Dong
Liu, Yiqun
Computation and Language
Artificial Intelligence
Machine Learning
Learning from preference feedback is a common practice for aligning large language models~(LLMs) with human value. Conventionally, preference data is learned and encoded into a scalar reward model that connects a value head with an LLM to produce a scalar score as preference or reward. However, scalar models lack interpretability and are known to be susceptible to biases in datasets. This paper investigates leveraging the generation capability of LLMs to address both limitations in one shot. Specifically, we prompt the pre-trained LLM to generate positive and negative judgments, both supported with rationales in natural language form. The self-generated contrastive judgment pairs are used to train the generative judge with Direct Preference Optimization (DPO). This proposal of training the generative Judge using self-generated Contrastive judgments (Con-J) ensures natural interpretability due to the generated rationales together with the judgments, as well as high robustness against bias without the need for an additional reward head. Experimental results show that the performance of Con-J is comparable to the scalar reward model trained on the same collection of preference data, and demonstrate its superior interpretability and robustness in encoding human preferences.
title Beyond Scalar Reward Model: Learning Generative Judge from Preference Data
topic Computation and Language
Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2410.03742