CLSep 17, 2024

Self-Evolutionary Large Language Models through Uncertainty-Enhanced Preference Optimization

arXiv:2409.11212v19 citationsh-index: 3
Originality Incremental advance
AI Analysis

This work addresses a key bottleneck in training large language models for iterative preference optimization, offering a domain-specific improvement.

The paper tackles the problem of noisy preference data in iterative preference optimization for large language models by introducing an Uncertainty-enhanced Preference Optimization (UPO) framework, which uses pair-wise uncertainty estimation and reliable feedback sampling to improve performance, as shown in extensive experiments over multiple benchmarks.

Iterative preference optimization has recently become one of the de-facto training paradigms for large language models (LLMs), but the performance is still underwhelming due to too much noisy preference data yielded in the loop. To combat this issue, we present an \textbf{U}ncertainty-enhanced \textbf{P}reference \textbf{O}ptimization (UPO) framework to make the LLM self-evolve with reliable feedback. The key idea is mitigating the noisy preference data derived from the current policy and reward models by performing pair-wise uncertainty estimation and judiciously reliable feedback sampling. To reach this goal, we thus introduce an estimator model, which incorporates Monte Carlo (MC) dropout in Bayesian neural network (BNN) to perform uncertainty estimation for the preference data derived from the LLM policy. Compared to the existing methods that directly filter generated responses based on the reward score, the estimator focuses on the model uncertainty in a pair-wise manner and effectively bypasses the confirmation bias problem of the reward model. Additionally, we also propose an uncertainty-enhanced self-evolution algorithm to improve the robustness of preference optimization and encourage the LLM to generate responses with both high reward and certainty. Extensive experiments over multiple benchmarks demonstrate that our framework substantially alleviates the noisy problem and improves the performance of iterative preference optimization.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes