atlas

Research map / Reinforcement learning / RL from feedback

Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Data

ICML 2024 · Reinforcement learning › RL from feedback · approach: RL for LLM reasoning · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Systematic study of preference fine-tuning methods (PPO, REINFORCE, RWR, best-of-N, DPO/IPO, Pref-FT) showing on-policy sampling and negative gradients help, especially when reward peaks lie in low-likelihood regions of the reference policy, and that on-policy contrastive training is complementary.

Problem

Practitioners are unsure whether on-policy RL is required versus contrastive or supervised fine-tuning for preference fine-tuning of LLMs, and whether preference data should be collected on-policy.

Approach

Characterize preference fine-tuning methods along on-policy sampling, sample reuse, and negative gradient axes, and evaluate them in didactic bandits, synthetic LLM tasks, and full-scale AlpacaFarm/UltraFeedback; explain findings via mode-seeking (reverse KL) versus mode-covering (forward KL) objectives.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use more frequent, smaller-batch on-policy samplingBest-of-N · Bandit R1 and R2Reward / convergenceHelped
Use more off-policy updates instead of frequent on-policy samplingPPO · Mode LengthGold rewardNo clear effect
Use more on-policy sampling (smaller B)PPO and on-policy RWR / REINFORCE · Min Length and Skew LengthGold rewardHelped
Increase sample reuse from T=1 to T=8 (ablation)PPO · Synthetic LLM problemsGold reward: T=8; T=1No clear effect
Increase sample reuse from T=1 to T=2 (ablation)On-policy Best-of-N · Synthetic LLM problemsGold reward: T=1 to 2Helped
Add a negative-gradient loss on dispreferred responses (ablation)Best-of-N · Bandit R1 and R2RewardHelped
Use DPO with a negative gradient instead of Pref-FTOffline preference fine-tuning · Min Length and Skew LengthRewardHelped
Use DPO instead of Pref-FTOffline preference fine-tuning · Mode LengthRewardNo clear effect
Use on-policy DPO / IPO instead of offline DPO / IPODPO / IPO · Bandit R1 and R2; synthetic LLM problemsReward / convergenceHelped
Use on-policy DPO / IPO instead of offline DPO / IPODPO / IPO · Bandit (R1)Reward: 0.82 (0.04) -> 0.92 (0.01)Helped
Use on-policy DPO / IPO instead of offline DPO / IPODPO / IPO · Min LengthTime: 1.3 hours -> 0.4 hoursHelped
Use on-policy DPO / IPO instead of offline DPO / IPODPO / IPO · Skew LengthCompletion Length: 11.8 (14.0) -> 0.0 (0.0)Helped

Surprising findings

Limitations

Experimental setup

Datasets: AlpacaFarm UltraFeedback UltraChat

Benchmarks: AlpacaFarm UltraFeedback

Metrics: gold reward proxy reward completion length wall-clock time

Baselines: PPO REINFORCE RWR Best-of-N Pref-FT DPO IPO Binary FeedME

Builds on: DPO IPO PPO REINFORCE ReST

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy