| Challenge: | Direct Preference Optimization (DPO) is an efficient method for ensuring safety and reliability in practical applications. |
| Approach: | They propose a dynamic target margin preference optimization algorithm that adjusts reward margins at the pairwise level. |
| Outcome: | The proposed method achieves an average 4.4% improvement over baselines, setting new benchmarks for state-of-the-art performance. |
Similar Papers
Margin Matching Preference Optimization: Enhanced Model Alignment with Granular Feedback (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for large language models rely on binary labels that fail to capture the subtle differences in relative quality between pairs. |
| Approach: | They propose a method that incorporates relative quality margins into optimization to improve LLM policies and reward models. |
| Outcome: | The proposed approach outperforms baseline methods on popular benchmarks including MT-bench and RewardBench. |
DynamicFocalPO: Adaptive Focusing Strategy for Preference Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent preference optimization algorithms such as Direct Preference Optimization (DPO) have become prevalent for aligning large language models with human preferences. |
| Approach: | They propose a preference optimization algorithm that introduces a modulating factor that down-weighs misranked preference pairs and employs focusing strategy that adapts over the course of training. |
| Outcome: | Experiments show that DynamicFocalPO surpasses both DPO and FocalPO on benchmarks including Alpaca Eval 2.0 and Arena-Hard using Mistral-Base-7B and Llama-3-Instruct-8B. |
MPPO: Multi Pair-wise Preference Optimization for LLMs with Arbitrary Negative Samples (2025.coling-main)
Copied to clipboard
Shuo Xie, Fangzhi Zhu, Jiahui Wang, Lulu Wen, Wei Dai, Xiaowei Chen, Junxiong Zhu, Kai Zhou, Bo Zheng
| Challenge: | Existing preference optimization methods such as DPO and KTO are inherently derived from PPO, requiring a reference model that adds GPU memory resources and relies heavily on abundant preference data. |
| Approach: | They propose an algorithm that leverages the average likelihood of model responses to fit the reward function and maximizes the utilization of preference data. |
| Outcome: | The proposed algorithm outperforms DPO, ORPO, and SimPO on MT-Bench and Arena-Hard. |
Direct Preference Optimization with an Offset (2024.findings-acl)
Copied to clipboard
| Challenge: | Direct preference optimization (DPO) fine-tunes language models with human preferences . but not all preference pairs are equal; sometimes, the preferred response is only slightly better than the dispreferred one. |
| Approach: | They propose a generalization of direct preference optimization that does not treat every preference pair equally during fine-tuning. |
| Outcome: | The proposed algorithm outperforms DPO on tasks with limited preference pairs . it requires the difference between likelihood of preferred and dispreferred response to be greater than offset value . |
ASPO: Adaptive Sentence-Level Preference Optimization for Fine-Grained Multimodal Reasoning (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent advances have extended DPO to multimodal scenarios, achieving strong performance. |
| Approach: | They propose to use a sentence-level preference optimization technique to optimize individual sentences for more precise preference optimization without additional models or parameters. |
| Outcome: | Experiments show that Adaptive Sentence-level Preference Optimization significantly improves the alignment of multimodal models. |
SparsePO: Controlling Preference Alignment of LLMs via Sparse Token Masks (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Current direct preference optimization algorithms focus on a strict set of tokens contributing signals of KL divergence and rewards to the loss function. |
| Approach: | They propose a method that automatically learns to weight the KL divergence and reward corresponding to each token during PO training. |
| Outcome: | The proposed method achieves +10% and +3% win-rate points in two PO scenarios. |
FocalPO: Enhancing Preference Optimizing by Focusing on Correct Preference Rankings (2025.acl-short)
Copied to clipboard
| Challenge: | Efficient preference optimization algorithms such as Direct Preference Optimization (DPO) have become a popular approach in aligning large language models with human preferences. |
| Approach: | They propose a preference optimization variant that instead down-weighs misranked preference pairs and prioritizes enhancing the modelâs understanding of pairs that it can already rank correctly. |
| Outcome: | The proposed model outperforms DPO on benchmarks like Alpaca Eval 2.0 and Arena-Hard using mistral-base-7B and Llama-3-Instruct-8B with the introduced hyperparameter fixed. |
Expectation Preference Optimization: Reliable Preference Estimation for Improving the Reasoning Capability of Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Pairwise preference optimization is used to improve supervised fine-tuning performance of large language models. |
| Approach: | They propose an algorithm that takes pairs of sample groups instead of single samples for preference learning. |
| Outcome: | The proposed algorithm outperforms baseline methods on reasoning benchmarks. |
SDPO: Segment-Level Direct Preference Optimization for Social Agents (2025.acl-long)
Copied to clipboard
Aobo Kong, Wentao Ma, Shiwan Zhao, Yongbin Li, Yuchuan Wu, Ke Wang, Xiaoqian Liu, Qicheng Li, Yong Qin, Fei Huang
| Challenge: | Direct Preference Optimization (DPO) has proven effective in aligning LLM behavior with human preferences across various tasks, but is limited in multi-turn social interactions. |
| Approach: | They propose a method which dynamically selects key segments within interactions to optimize multi-turn agent behavior. |
| Outcome: | The proposed methods outperform existing methods and proprietary LLMs on the SOTOPIA benchmark and show that they can improve social intelligence. |
Finding the Sweet Spot: Preference Data Construction for Scaling Preference Optimization (2025.acl-long)
Copied to clipboard
| Challenge: | Large language models generate unintended outputs due to their unsupervised nature. |
| Approach: | They propose a method to construct preference pairs of selected and rejected LLMs by repeated random sampling to improve alignment performance. |
| Outcome: | The proposed method improves performance as the sample size increases. |