mlsanityData to 14 Oct 2026

Stable Preference Optimization: A Bilevel Approach to Catastrophic Preference Shift

arXiv 2507.07723 ↗First posted 10 Jul 2025cs.AI cs.CL cs.LGcited by 2

On the map: LLM alignment / RLHF / preference optimisation → LLM preference optimization methods

Abstract (arXiv)

Direct Preference Learning has emerged as a dominant offline paradigm for preference optimization. Most of these methods are based on the Bradley-Terry (BT) model for pairwise preference ranking, which directly aligns language model with human preference. Prior work has observed a counter-intuitive phenomenon termed likelihood displacement, where the absolute probability of preferred responses decreases simultaneously during training. We demonstrate that such displacement can lead to a more devastating failure mode, which we defined as textitCatastrophic Preference Shift, where the lost preference probability mass inadvertently shifts toward out-of-distribution (OOD) responses. Such a failure mode is a key limitation shared across BT-style direct preference learning methods, due to the fundamental conflict between the unconstrained discriminative alignment and generative foundational capabilities, ultimately leading to severe performance degradation (e.g., SimPO suffers a significant drop in reasoning accuracy from 73.5% to 37.5%). We analyze existing BT-style methods from the probability evolution perspective and theoretically prove that these methods exhibit over-reliance on model initialization and can lead to preference shift. To resolve these counter-intuitive behaviors, we propose a theoretically grounded Stable Preference Optimization (SPO) framework that constrains preference learning within a safe alignment region. Empirical evaluations demonstrate that SPO effectively stabilizes and enhances the performance of existing BT-style preference learning methods. SPO provides new insights into the design of preference learning objectives and opens up new avenues towards more reliable and interpretable language model alignment.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in LLM preference optimization methods, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 43 of its 57 references that are in the map. First posted on arXiv 10 Jul 2025.

Builds on

43 of 57 references.

Closest ancestors · 11

Same direction, newest first

  1. 2025Rethinking DPO: The Role of Rejected Responses in Preference Misalignment15 Jun
  2. 2025SimPER: A Minimalist Approach to Preference Alignment without Hyperparameters2 Feb
  3. 2024SimPO: Simple Preference Optimization with a Reference-Free Reward23 May
  4. 2024From r to Q^*: Your Language Model is Secretly a Q-Function18 Apr
  5. 2024Towards Analyzing and Understanding the Limitations of DPO: A Theoretical Perspective6 Apr
  6. 2024ORPO: Monolithic Preference Optimization without Reference Model12 Mar
  7. 2024Negating Negatives: Alignment with Human Negative Samples via Distributional Dispreference Optimization6 Mar
  8. 2024Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive20 Feb
  9. 2024Contrastive Preference Optimization: Pushing the Boundaries of LLM Performance in Machine Translation16 Jan
  10. 2023Making Large Language Models Better Reasoners with Alignment5 Sep
  11. 2022Training language models to follow instructions with human feedback4 Mar

Other references · 32

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
  4. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  6. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  7. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,975
  8. 2019The Curious Case of Neural Text Degenerationcited by 2,916
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  10. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  11. 2020Learning to summarize from human feedbackcited by 2,588
  12. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
20 more
  1. 2019Fine-Tuning Language Models from Human Preferencescited by 2,150
  2. 2020Meta-Learning in Neural Networks: A Surveycited by 950
  3. 2024Length-Controlled AlpacaEval: A Simple Way to Debias Automatic Evaluatorscited by 897
  4. 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 405
  5. 2024Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMscited by 273
  6. 2023MuSR: Testing the Limits of Chain-of-thought with Multistep Soft Reasoningcited by 201
  7. 2024Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Datacited by 185
  8. 2019Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methodscited by 148
  9. 2024Provably Mitigating Overoptimization in RLHF: Your SFT Loss is Implicitly an Adversarial Regularizercited by 109
  10. 2022BOME! Bilevel Optimization Made Easy: A Simple First-Order Approachcited by 105
  11. 2023A Fully First-Order Method for Stochastic Bilevel Optimizationcited by 100
  12. 2020A Theoretical Analysis of the Repetition Problem in Text Generationcited by 83
  13. 2024SEAL: Safety-enhanced Aligned LLM Fine-tuning via Bilevel Data Selectioncited by 64
  14. 2024ScaleBiO: Scalable Bilevel Optimization for LLM Data Reweightingcited by 37
  15. 2018Robust Optimization over Multiple Domainscited by 34
  16. 2025PR-Attack: Coordinated Prompt-RAG Attacks on Retrieval-Augmented Generation in Large Language Models via Bilevel Optimizationcited by 32
  17. 2024Tri-Level Navigator: LLM-Empowered Tri-Level Learning for Time Series OOD Generalizationcited by 12
  18. 2024Top Pass: Improve Code Generation by Pass@k-Maximized Code Rankingcited by 9
  19. 2020Overall error analysis for the training of deep neural networks via stochastic gradient descent with random initialisationcited by 7
  20. 2024Triadic-OCD: Asynchronous Online Change Detection with Provable Robustness, Optimality, and Convergencecited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Unintentional Unalignment: Likelihood Displacement in Direct Preference Optimization
  2. 2025DPO-Shift: Shifting the Distribution of Direct Preference Optimization
  3. 2025BPO: Revisiting Preference Modeling in Direct Preference Optimization
  4. 2024Direct Preference Optimization With Unobserved Preference Heterogeneity: The Necessity of Ternary Preferences
  5. 2025Direct Preference Optimization with Unobserved Preference Heterogeneity: The Necessity of Ternary Preferences
  6. 2026Towards Bridging the Gap Between Offline and Iterative Alignment via Preference Distillation
  7. 2026SLIME: Stabilized Likelihood Implicit Margin Enforcement for Preference Optimization
  8. 2026Beyond Uniform Forgetting: A Study of Sequential Direct Preference Optimization Across Preference Settings