Debiasing Online Preference Learning via Preference Feature Preservation

Recent preference learning frameworks for large language models (LLMs) simplify human preferences with binary pairwise comparisons and scalar rewards.This simplification could make LLMs' responses biased to mostly preferred features, and would be exacerbated during the iterations of online preference learning steps.To address these challenges, we propose a novel framework coined PFP (Preference Feature Preservation).The key idea of PFP is maintaining the distribution of human preference features and utilizing such rich signals throughout the online preference learning process.Specifically, PFP first extract preference features from offline pairwise human preference data and trains a feature classifier.Then, using trained classifier and the distribution preserving optimization, PFP maps appropriate preference features for a new input instruction during online learning.Lastly, PFP trains LLM using the existing preference learning method, by incorporating the preference feature into system prompts and enabling LLM to explicitly handle various human preferences.Our experiments demonstrate that PFP successfully mitigates the bias in preference features during online learning, and hence achieves superior performance compared to previous preference learning methods on standard benchmarks to evaluate LLM alignment. 1

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.1034
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Debiasing Online Preference Learning via Preference Feature Preservation

Jinsung Yoon, Dongyoung Kim, Jaehyung Kim, Jinwoo Shin
Text and Document Classification Technologies
article

Debiasing Online Preference Learning via Preference Feature Preservation

Jinsung Yoon, Dongyoung Kim, Jaehyung Kim, Jinwoo Shin
article en

Abstract

Recent preference learning frameworks for large language models (LLMs) simplify human preferences with binary pairwise comparisons and scalar rewards.This simplification could make LLMs' responses biased to mostly preferred features, and would be exacerbated during the iterations of online preference learning steps.To address these challenges, we propose a novel framework coined PFP (Preference Feature Preservation).The key idea of PFP is maintaining the distribution of human preference features and utilizing such rich signals throughout the online preference learning process.Specifically, PFP first extract preference features from offline pairwise human preference data and trains a feature classifier.Then, using trained classifier and the distribution preserving optimization, PFP maps appropriate preference features for a new input instruction during online learning.Lastly, PFP trains LLM using the existing preference learning method, by incorporating the preference feature into system prompts and enabling LLM to explicitly handle various human preferences.Our experiments demonstrate that PFP successfully mitigates the bias in preference features during online learning, and hence achieves superior performance compared to previous preference learning methods on standard benchmarks to evaluate LLM alignment. 1

National IT Industry Promotion Agency, Korea Advanced Institute of Science and Technology, Ministry of Science and ICT, South Korea, Institute for Information and Communications Technology Promotion
Openalex Percentile: Top 90%
Text and Document Classification Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.