ORPO: Monolithic Preference Optimization without Reference Model (2024.emnlp-main)
Copied to clipboard
| Challenge: | Pre-trained language models with vast training corpora have shown remarkable abilities in diverse natural language processing tasks. |
| Approach: | They propose a model-free monolithic odds ratio preference optimization algorithm, ORPO, to improve preference alignment. |
| Outcome: | The proposed algorithm outperforms state-of-the-art language models with more than 7B and 13B parameters on the ultrafeedback alone. |
Similar Papers
A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques (2024.acl-long)
Copied to clipboard
| Challenge: | Large language models are pre-trained on trillions of tokens and instruction-tuned or aligned to specific preferences. |
| Approach: | They propose guidelines to help researchers perform more effective parameter-efficient LLM alignment. |
| Outcome: | The proposed methods outperform preference optimization and outperformed pre-trained models on three key axes. |
Insights into Alignment: Evaluating DPO and its Variants Across Multiple Tasks (2025.acl-srw)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) excel in math reasoning problemsolving, text generation, summarization, creative writing, among other tasks. |
| Approach: | They evaluate Direct Preference Optimization and its variants for aligning Large Language Models with human preferences. |
| Outcome: | The proposed alignment methods achieve near-optimal performance even with smaller subsets of training data. |
InfoPO: On Mutual Information Maximization for Large Language Model Alignment (2025.naacl-long)
Copied to clipboard
Teng Xiao, Zhen Ge, Sujay Sanghavi, Tian Wang, Julian Katz-Samuels, Marc Versage, Qingjun Cui, Trishul Chilimbi
| Challenge: | Recent studies have shown that direct preference optimization and its variants can be useful for fine-tuning large language models with human preferences data. |
| Approach: | They propose a preference fine-tuning algorithm that effectively and efficiently aligns large language models using preference data. |
| Outcome: | Extensive experiments show that the proposed algorithm outperforms established baselines on reasoning tasks. |
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 . |
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. |
Beyond One-Preference-Fits-All Alignment: Multi-Objective Direct Preference Optimization (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent approaches to language model alignment assume homogeneous human preferences, but actual human preferences vary widely and are hard to satisfy with a single language model. |
| Approach: | They propose an RL-free extension of Direct Preference Optimization (DPO) that folds language modeling directly into reward modeling and trains language models as collective reward models that combine all objectives with specific weights. |
| Outcome: | The proposed method matches or outperforms existing methods in safety alignment and long-form question answering. |
sDPO: Don’t Use Your Data All at Once (2025.coling-industry)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly requiring precision and accuracy in alignment tuning. |
| Approach: | They propose a stepwise DPO technique that partitions available preference datasets incrementally rather than utilizing entire dataset simultaneously. |
| Outcome: | The proposed technique improves the accuracy of reference models and the overall performance of the final model. |
Select Before Use: On the Importance of Reference Model Selection in Preference Alignment (2026.acl-long)
Copied to clipboard
| Challenge: | Supervised Fine-Tuning (SFT) is used as the initialization and reference model for subsequent preference alignment. |
| Approach: | They propose to use RewardRank to estimate initial implicit alignment between reference model and preference objective to ensure LLMs generate safe, helpful, and instruction-aligned content. |
| Outcome: | Empirical evidence shows that using the selected model as reference can gain up to 67.6% relative increase on length-controlled win rate compared to baselines. |
Instantly Learning Preference Alignment via In-context DPO (2025.naacl-long)
Copied to clipboard
| Challenge: | Presently, mainstream approaches to HPA heavily depend on fine-tuning . however, the huge computational and annotation costs of fine-timing are hard to ignore . |
| Approach: | They propose a tuning-free approach to HPA using LLMs' decoding . they first rethink the derivation procedures of DPO and build an instant scorer . |
| Outcome: | The proposed approach outperforms existing methods even with tuning-free baselines and an upgraded scorer. |
Robust Preference Optimization via Dynamic Target Margins (2025.findings-acl)
Copied to clipboard
| 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. |