Challenge: Reinforcement Learning from Human Feedback (RLHF) is an effective approach for aligning language models to human preferences.
Approach: They compare the accuracy of DPORM and EXRM with a reward function for scoring human preferences.
Outcome: The proposed methods can approximate an EXRM on the limit infinite samples, but it is unclear how effective they are in practice.

Similar Papers

Reward Generalization in RLHF: A Topological Perspective (2025.findings-acl)

Copied to clipboard

Challenge: Existing alignment methods share a common topology of information flow, but their alternatives have not been thoroughly explored.
Approach: They propose a theory of reward generalization in reinforcement learning from human feedback . they propose induced Bayesian networks to model the impact of dataset topologies on reward generalisation .
Outcome: The proposed method achieves an average win rate of 65% on three NLP tasks.
Filtered Direct Preference Optimization (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies on the impact of RLHF on text quality have focused on reward-model-free RL.
Approach: They propose an extension of direct preference optimization to improve model performance by analyzing the quality of the preference dataset.
Outcome: The proposed method improves the performance of models optimized with DPO over those optimized with reward-model-based RLHF.
CRPO: Confidence-Reward Driven Preference Optimization for Machine Translation (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have shown great potential in natural language processing tasks, but their application to machine translation remains challenging due to pretraining on predominantly English-centric datasets.
Approach: They propose a method that combines reward scores with model confidence to improve model selection for fine-tuning.
Outcome: The proposed method outperforms existing methods in translation accuracy and data efficiency.
Towards Pareto-Efficient RLHF: Paying Attention to a Few High-Reward Samples with Reward Dropout (2024.findings-emnlp)

Copied to clipboard

Challenge: RLHF is a bi-objective problem that has the nature of a Pareto optimization . reward dropout is generalizable and most effective with non-pretrained target models .
Approach: They propose a method that guarantees a Pareto improvement by leveraging reinforcement learning to fine-tune language models.
Outcome: The proposed method guarantees a Pareto improvement on two benchmark datasets . it is generalizable and most effective with non-pretrained target models, saving the effort of pretraining.
IPO: Your Language Model is Secretly a Preference Classifier (2025.acl-long)

Copied to clipboard

Challenge: Reinforcement learning from human feedback (RLHF) is the primary method for aligning large language models with human preferences, but it often incurs significant computational and financial costs due to its reliance on training external reward models or human-labeled preferences.
Approach: They propose an alternative approach that leverages generative LLMs as preference classifiers to reduce the dependence on external reward models or human-labeled preferences.
Outcome: The proposed approach reduces the dependence on external reward models or human-labeled preferences by using generative LLMs as preference classifiers.
RLHF Algorithms Ranked: An Extensive Evaluation Across Diverse Tasks, Rewards, and Hyperparameters (2025.emnlp-industry)

Copied to clipboard

Challenge: Proximal Policy Optimization (PPO) has fallen out of favor for Large Language Models (LLMs), but its complexity and inefficiency have spurred the investigation of simpler alternatives.
Approach: They evaluate 17 RLHF algorithms on two benchmarks, OpenAI’s TL;DR Summarization and Anthropic’s Helpfulness / Harmlessness.
Outcome: The proposed methods are based on OpenAI’s TL;DR Summarization and Anthropic’s Helpfulness / Harmlessness benchmarks with two different reward models and a Rules based reward model.
Self-supervised Preference Optimization: Enhance Your Language Model with Preference Degree Awareness (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent studies have focused on replacing the reward model in Reinforcement Learning with Human Feedback (RLHF) methods for Large Language Models (LLMs).
Approach: They propose a self-supervised preference optimization framework that replaces the reward model with a preference loss and alignment loss to improve LLMs' ability to understand human preferences.
Outcome: The proposed framework can be integrated with existing preference optimization methods and significantly boost their performance.
Step-level Value Preference Optimization for Mathematical Reasoning (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for generating preference-level annotations do not capture the fine-grained quality of model outputs in multi-step reasoning tasks.
Approach: They propose an algorithm to automatically annotate step-level preferences for multi-step reasoning using Monte Carlo Tree Search.
Outcome: The proposed algorithm achieves state-of-the-art performance on in-domain and out-of domain mathematical reasoning benchmarks.
Arithmetic Control of LLMs for Diverse User Preferences: Directional Preference Alignment with Multi-Objective Rewards (2024.acl-long)

Copied to clipboard

Challenge: Reinforcement Learning from Human Feedback (RLHF) relies on scalar rewards to capture user preferences.
Approach: They propose a framework that integrates multi-objective reward modeling to represent diverse preference profiles.
Outcome: The proposed method improves performance across reward objectives and targets.
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.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations