Beyond the Binary: Capturing Diverse Preferences With Reward Regularization

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Padmakumar, Vishakh, Jin, Chuanyang, Kirk, Hannah Rose, He, He
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866910728179417088
author Padmakumar, Vishakh
Jin, Chuanyang
Kirk, Hannah Rose
He, He
author_facet Padmakumar, Vishakh
Jin, Chuanyang
Kirk, Hannah Rose
He, He
contents Large language models (LLMs) are increasingly deployed via public-facing interfaces to interact with millions of users, each with diverse preferences. Despite this, preference tuning of LLMs predominantly relies on reward models trained using binary judgments where annotators select the preferred choice out of pairs of model outputs. In this work, we argue that this reliance on binary choices does not capture the broader, aggregate preferences of the target user in real-world tasks. We propose a taxonomy that identifies two dimensions of subjectivity where different users disagree on the preferred output-namely, the Plurality of Responses to Prompts, where prompts allow for multiple correct answers, and the Indistinguishability of Responses, where candidate outputs are paraphrases of each other. We show that reward models correlate weakly with user preferences in these cases. As a first step to address this issue, we introduce a simple yet effective method that augments existing binary preference datasets with synthetic preference judgments to estimate potential user disagreement. Incorporating these via a margin term as a form of regularization during model training yields predictions that better align with the aggregate user preferences.
format Preprint
id arxiv_https___arxiv_org_abs_2412_03822
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Beyond the Binary: Capturing Diverse Preferences With Reward Regularization
Padmakumar, Vishakh
Jin, Chuanyang
Kirk, Hannah Rose
He, He
Computation and Language
Artificial Intelligence
Large language models (LLMs) are increasingly deployed via public-facing interfaces to interact with millions of users, each with diverse preferences. Despite this, preference tuning of LLMs predominantly relies on reward models trained using binary judgments where annotators select the preferred choice out of pairs of model outputs. In this work, we argue that this reliance on binary choices does not capture the broader, aggregate preferences of the target user in real-world tasks. We propose a taxonomy that identifies two dimensions of subjectivity where different users disagree on the preferred output-namely, the Plurality of Responses to Prompts, where prompts allow for multiple correct answers, and the Indistinguishability of Responses, where candidate outputs are paraphrases of each other. We show that reward models correlate weakly with user preferences in these cases. As a first step to address this issue, we introduce a simple yet effective method that augments existing binary preference datasets with synthetic preference judgments to estimate potential user disagreement. Incorporating these via a margin term as a form of regularization during model training yields predictions that better align with the aggregate user preferences.
title Beyond the Binary: Capturing Diverse Preferences With Reward Regularization
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2412.03822