Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.18239 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918476790104064 |
|---|---|
| author | Chen, Wei Wu, Yubing Yang, Junmei Zeng, Delu Zhao, Qibin Paisley, John Chen, Min Wang, Zhou |
| author_facet | Chen, Wei Wu, Yubing Yang, Junmei Zeng, Delu Zhao, Qibin Paisley, John Chen, Min Wang, Zhou |
| contents | Preference optimization is widely used to align large language models (LLMs) with human preferences. However, many margin-based methods also suppress the chosen response when they try to suppress the rejected one, and there is no general way to prevent this across different objectives.
We address this issue with a unified incentive-score decomposition of preference optimization, revealing that different objectives share the same local update directions and differ only in their scalar weights.
This decomposition provides a common framework for analyzing objectives that were previously studied in separate settings.
Building on this decomposition, by analyzing the dynamics of the chosen/rejected likelihoods, we identify the disentanglement band (DB), a simple, testable condition that tells us when training can follow the desired path: suppress the loser while preserving the winner, possibly after an early stage.
Using the DB, we propose reward calibration (RC), a plug-and-play method that adaptively rebalances the updates for chosen and rejected responses to satisfy the DB, without redesigning the base objective.
Empirical results show that RC leads to more disentangled dynamics, with better downstream performance observed across several settings. Our code is available at https://github.com/IceyWuu/DisentangledPreferenceOptimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_18239 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Towards Disentangled Preference Optimization Dynamics: Suppress the Loser, Preserve the Winner Chen, Wei Wu, Yubing Yang, Junmei Zeng, Delu Zhao, Qibin Paisley, John Chen, Min Wang, Zhou Machine Learning Artificial Intelligence Preference optimization is widely used to align large language models (LLMs) with human preferences. However, many margin-based methods also suppress the chosen response when they try to suppress the rejected one, and there is no general way to prevent this across different objectives. We address this issue with a unified incentive-score decomposition of preference optimization, revealing that different objectives share the same local update directions and differ only in their scalar weights. This decomposition provides a common framework for analyzing objectives that were previously studied in separate settings. Building on this decomposition, by analyzing the dynamics of the chosen/rejected likelihoods, we identify the disentanglement band (DB), a simple, testable condition that tells us when training can follow the desired path: suppress the loser while preserving the winner, possibly after an early stage. Using the DB, we propose reward calibration (RC), a plug-and-play method that adaptively rebalances the updates for chosen and rejected responses to satisfy the DB, without redesigning the base objective. Empirical results show that RC leads to more disentangled dynamics, with better downstream performance observed across several settings. Our code is available at https://github.com/IceyWuu/DisentangledPreferenceOptimization. |
| title | Towards Disentangled Preference Optimization Dynamics: Suppress the Loser, Preserve the Winner |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2604.18239 |