From Demonstrations to Rewards: Alignment Without Explicit Human Preferences

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zeng, Siliang, Liu, Yao, Rangwala, Huzefa, Karypis, George, Hong, Mingyi, Fakoor, Rasool
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912279581163520
author Zeng, Siliang
Liu, Yao
Rangwala, Huzefa
Karypis, George
Hong, Mingyi
Fakoor, Rasool
author_facet Zeng, Siliang
Liu, Yao
Rangwala, Huzefa
Karypis, George
Hong, Mingyi
Fakoor, Rasool
contents One of the challenges of aligning large models with human preferences lies in both the data requirements and the technical complexities of current approaches. Predominant methods, such as RLHF, involve multiple steps, each demanding distinct types of data, including demonstration data and preference data. In RLHF, human preferences are typically modeled through a reward model, which serves as a proxy to guide policy learning during the reinforcement learning stage, ultimately producing a policy aligned with human preferences. However, in this paper, we propose a fresh perspective on learning alignment based on inverse reinforcement learning principles, where the optimal policy is still derived from reward maximization. However, instead of relying on preference data, we directly learn the reward model from demonstration data. This new formulation offers the flexibility to be applied even when only demonstration data is available, a capability that current RLHF methods lack, and it also shows that demonstration data offers more utility than what conventional wisdom suggests. Our extensive evaluation, based on public reward benchmark, HuggingFace Open LLM Leaderboard and MT-Bench, demonstrates that our approach compares favorably to state-of-the-art methods that rely solely on demonstration data.
format Preprint
id arxiv_https___arxiv_org_abs_2503_13538
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle From Demonstrations to Rewards: Alignment Without Explicit Human Preferences
Zeng, Siliang
Liu, Yao
Rangwala, Huzefa
Karypis, George
Hong, Mingyi
Fakoor, Rasool
Machine Learning
Artificial Intelligence
One of the challenges of aligning large models with human preferences lies in both the data requirements and the technical complexities of current approaches. Predominant methods, such as RLHF, involve multiple steps, each demanding distinct types of data, including demonstration data and preference data. In RLHF, human preferences are typically modeled through a reward model, which serves as a proxy to guide policy learning during the reinforcement learning stage, ultimately producing a policy aligned with human preferences. However, in this paper, we propose a fresh perspective on learning alignment based on inverse reinforcement learning principles, where the optimal policy is still derived from reward maximization. However, instead of relying on preference data, we directly learn the reward model from demonstration data. This new formulation offers the flexibility to be applied even when only demonstration data is available, a capability that current RLHF methods lack, and it also shows that demonstration data offers more utility than what conventional wisdom suggests. Our extensive evaluation, based on public reward benchmark, HuggingFace Open LLM Leaderboard and MT-Bench, demonstrates that our approach compares favorably to state-of-the-art methods that rely solely on demonstration data.
title From Demonstrations to Rewards: Alignment Without Explicit Human Preferences
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2503.13538