Doubly Robust Alignment for Large Language Models

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Xu, Erhan, Ye, Kai, Zhou, Hongyi, Zhu, Luhan, Quinzan, Francesco, Shi, Chengchun
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911238407061504
author Xu, Erhan
Ye, Kai
Zhou, Hongyi
Zhu, Luhan
Quinzan, Francesco
Shi, Chengchun
author_facet Xu, Erhan
Ye, Kai
Zhou, Hongyi
Zhu, Luhan
Quinzan, Francesco
Shi, Chengchun
contents This paper studies reinforcement learning from human feedback (RLHF) for aligning large language models with human preferences. While RLHF has demonstrated promising results, many algorithms are highly sensitive to misspecifications in the underlying preference model (e.g., the Bradley-Terry model), the reference policy, or the reward function, resulting in undesirable fine-tuning. To address model misspecification, we propose a doubly robust preference optimization algorithm that remains consistent when either the preference model or the reference policy is correctly specified (without requiring both). Our proposal demonstrates superior and more robust performance than state-of-the-art algorithms, both in theory and in practice. The code is available at https://github.com/DRPO4LLM/DRPO4LLM
format Preprint
id arxiv_https___arxiv_org_abs_2506_01183
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Doubly Robust Alignment for Large Language Models
Xu, Erhan
Ye, Kai
Zhou, Hongyi
Zhu, Luhan
Quinzan, Francesco
Shi, Chengchun
Machine Learning
Artificial Intelligence
This paper studies reinforcement learning from human feedback (RLHF) for aligning large language models with human preferences. While RLHF has demonstrated promising results, many algorithms are highly sensitive to misspecifications in the underlying preference model (e.g., the Bradley-Terry model), the reference policy, or the reward function, resulting in undesirable fine-tuning. To address model misspecification, we propose a doubly robust preference optimization algorithm that remains consistent when either the preference model or the reference policy is correctly specified (without requiring both). Our proposal demonstrates superior and more robust performance than state-of-the-art algorithms, both in theory and in practice. The code is available at https://github.com/DRPO4LLM/DRPO4LLM
title Doubly Robust Alignment for Large Language Models
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2506.01183