English

Optimal Transport-Based Token Weighting scheme for Enhanced Preference Optimization

Computation and Language 2025-05-27 v1 Artificial Intelligence Machine Learning

Abstract

Direct Preference Optimization (DPO) has emerged as a promising framework for aligning Large Language Models (LLMs) with human preferences by directly optimizing the log-likelihood difference between chosen and rejected responses. However, existing methods assign equal importance to all tokens in the response, while humans focus on more meaningful parts. This leads to suboptimal preference optimization, as irrelevant or noisy tokens disproportionately influence DPO loss. To address this limitation, we propose \textbf{O}ptimal \textbf{T}ransport-based token weighting scheme for enhancing direct \textbf{P}reference \textbf{O}ptimization (OTPO). By emphasizing semantically meaningful token pairs and de-emphasizing less relevant ones, our method introduces a context-aware token weighting scheme that yields a more contrastive reward difference estimate. This adaptive weighting enhances reward stability, improves interpretability, and ensures that preference optimization focuses on meaningful differences between responses. Extensive experiments have validated OTPO's effectiveness in improving instruction-following ability across various settings\footnote{Code is available at https://github.com/Mimasss2/OTPO.}.

Keywords

Cite

@article{arxiv.2505.18720,
  title  = {Optimal Transport-Based Token Weighting scheme for Enhanced Preference Optimization},
  author = {Meng Li and Guangda Huzhang and Haibo Zhang and Xiting Wang and Anxiang Zeng},
  journal= {arXiv preprint arXiv:2505.18720},
  year   = {2025}
}

Comments

24 pages, 11 figures. Accepted by ACL 2025 (main)

R2 v1 2026-07-01T02:35:59.743Z