Gradient-Gated DPO: Stabilizing Preference Optimization in Language Models
cs.LG
Submitted: 2026-05-04
Updated: 2026-09-21
Comments: 30 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: Direct Preference Optimization (DPO) improves relative preference by increasing the margin between chosen and rejected responses, but this objective does not specify how probability mass should be
Terminology
Abstract
Direct Preference Optimization (DPO) improves relative preference by increasing the margin between chosen and rejected responses, but this objective does not specify how probability mass should be redistributed to achieve that margin. Consequently, preference separation can improve even as probability mass collapses away from both preferred and unrelated responses, a phenomenon associated with the squeezing effect. We show that this pathology is localized: continued negative updates become destructive when rejected responses enter low-probability valleys, where further suppression induces harmful redistribution through the coupled softmax geometry. We introduce Gradient-Gated Preference Optimization (Gate-DPO), which uses the current probability geometry of each rejected response to selectively attenuate its contribution, limiting excessive rejected suppression while delaying preference-loss saturation. Gate-DPO is objective-agnostic and composes with existing preference methods. Across four architectures, two preference datasets, and multiple objectives, gating consistently reduces squeezing and improves chosen-response likelihood, while exhibiting robust reductions in rejected-response collapse across architectures and objectives. Mass-dynamics analysis further shows that large preference margins can conceal substantial suppression of unrelated responses, while gating achieves healthier redistribution. Together, our results show that preference margin alone is insufficient to characterize optimization health and that selectively controlling probability dynamics provides a simple, general mechanism for stabilizing preference optimization.
Sources
- A General Theoretical Paradigm to Understand Learning from Human Preferences
- Qwen Technical Report
- Constitutional AI: Harmlessness from AI Feedback
- Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback
- Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models
- UltraFeedback: Boosting Language Models with Scaled AI Feedback
- KTO: Model Alignment as Prospect Theoretic Optimization
- Direct Language Model Alignment from Online AI Feedback
- Provably Mitigating Overoptimization in RLHF: Your SFT Loss is Implicitly an Adversarial Regularizer
- Disentangling Length from Quality in Direct Preference Optimization
- Direct Preference Optimization: Your Language Model is Secretly a Reward Model
- Learning Dynamics of LLM Finetuning
- Proximal Policy Optimization Algorithms
- Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Data
- LLaMA: Open and Efficient Foundation Language Models
- Secrets of RLHF in Large Language Models Part II: Reward Modeling
- Self-Play Preference Optimization for Language Model Alignment
- Cal-DPO: Calibrated Direct Preference Optimization for Language Model Alignment
- Contrastive Preference Optimization: Pushing the Boundaries of LLM Performance in Machine Translation
- A Common Pitfall of Margin-based Language Model Alignment: Gradient Entanglement
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks