Towards Bridging the Reward-Generation Gap in Direct Alignment Algorithms

Read full text
Authors: Zeguan Xiao, Yun Chen, Jian Yang, Guanhua Chen, Ke Tang
Cited by: 0

Abstract

Direct Alignment Algorithms (DAAs), such as Direct Preference Optimization (DPO) and Simple Preference Optimization (SimPO), have emerged as efficient alternatives to Reinforcement Learning from Human Feedback (RLHF) algorithms for aligning large language models (LLMs) with human preferences.However, DAAs suffer from a fundamental limitation we identify as the "reward-generation gap"-a discrepancy between training objectives and autoregressive decoding dynamics.In this paper, we consider that one contributor to the reward-generation gap is the mismatch between the inherent importance of prefix tokens during the LLM generation process and how this importance is reflected in the implicit reward functions of DAAs.To bridge the gap, we adopt a token-level MDP perspective of DAAs to analyze its limitations and introduce a simple yet effective approach called Prefix-Oriented Equal-length Training (POET), which truncates both preferred and dispreferred responses to match the shorter one's length.We conduct experiments with DPO and SimPO, two representative DAAs, demonstrating that POET improves over their standard implementations, achieving up to 11.8 points in AlpacaEval 2 and overall improvements across downstream tasks.These results underscore the need to mitigate the reward-generation gap in DAAs by better aligning training objectives with autoregressive decoding dynamics.

Fields of Study & Subjects

Machine Learning and Data Classification Explainable Artificial Intelligence (XAI) Recommender Systems and Techniques

Publication details

Journal / source
Findings of the Association for Computational Linguistics: ACL 2026
Publisher
Association for Computational Linguistics
Pages
14534–14548
Publication date
1 January 2026
Language
EN