Annotation-Efficient Language Model Alignment via Diverse and Representative Response Texts (2025.findings-emnlp)
Copied to clipboard
| Challenge: | obtaining large amount of preference annotations is difficult in many applications . obtaining a large amount is difficult, so a preference dataset needs limited annotation budget . |
| Approach: | They propose annotating preference over a subset of responses that maximizes diversity and representativeness from available responses and then annotates preference over the selected ones. |
| Outcome: | The proposed method outperforms baselines with the same annotation budget. |
Similar Papers
Enhancing Machine Translation with Self-Supervised Preference Data (2025.acl-long)
Copied to clipboard
| Challenge: | Current approaches to constructing preference data rely on human annotations. |
| Approach: | They propose a framework which efficiently constructs translation preference data for iterative training. |
| Outcome: | The proposed framework improves translation preference data on large language models. |
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. |
ComPO: Community Preferences for Language Model Personalization (2025.naacl-long)
Copied to clipboard
| Challenge: | Current methods for training language models with human feedback rely on subjective preferences that are assumed to account for an "average" user . however, annotating preferences is inherently subjective and results in generic models that generate outputs not preferred by many user groups. |
| Approach: | They propose a method to personalize preference optimization in LMs by contextualizing the probability distribution of model outputs with the preference provider. |
| Outcome: | The proposed method improves performance by focusing on group-level preferences rather than individual feedback. |
Not All Preference Pairs Are Created Equal: A Recipe for Annotation-Efficient Iterative Preference Learning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown remarkable capabilities to understand and generate human languages, supporting applications such as question answering, coding, and psychological counseling. |
| Approach: | They propose strategies to save annotation budgets while achieving competitive or even better performances for iterative preference learning. |
| Outcome: | The proposed methods save annotation budgets while achieving better performance. |
Disentangling Preference Representation and Text Generation for Efficient Individual Preference Alignment (2025.coling-main)
Copied to clipboard
| Challenge: | Human values are inherently diverse, making it insufficient to align LLMs solely with general preferences. |
| Approach: | They propose a flexible paradigm for individual preference alignment that disentangles preference representation from text generation in LLMs. |
| Outcome: | The proposed method produces aligned quality and better than PEFT-based methods while reducing training time for each new individual preference by 80% to 90%. |
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. |
Offline Preference Optimization via Maximum Marginal Likelihood Estimation (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing approaches to align Large Language Models with human preferences are complex and unstable. |
| Approach: | They propose a new approach that maximizes the marginal log-likelihood of a preferred text output by using the preference pair as samples for approximation. |
| Outcome: | The proposed approach maximizes the marginal log-likelihood of a preferred text output, using the preference pair as samples for approximation, and forgoes the need for both an explicit reward model and entropy maximization. |
RS-DPO: A Hybrid Rejection Sampling and Direct Preference Optimization Method for Alignment of Large Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Reinforcement learning with human feedback (RLHF) is widely employed to align large language models with user intent. |
| Approach: | They propose to combine rejection sampling and direct preference optimization to improve alignment with user intent by identifying pairs of contrastive samples from human annotator and alternative LLMs. |
| Outcome: | The proposed method outperforms existing methods including RS, PPO, and DPO in a limited resource environment. |
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. |
K-order Ranking Preference Optimization for Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing list-wise methods focus on optimizing list ranking consistency for LLMs to improve ranking abilities. |
| Approach: | They propose to extend the Plackett-Luce model to accommodate top-K ranking by extending the DPO’s Plact-Lucer model to dynamically determine appropriate K for different samples. |
| Outcome: | The proposed model can be extended to accommodate top-K ranking and improve training efficiency. |