Semantic-aware Wasserstein Policy Regularization for Large Language Model Alignment
This work addresses a key limitation of existing KL divergence–based policy regularization methods in large language model alignment, which only match token probabilities at identical positions and ignore semantic similarity, thereby constraining alignment performance. To overcome this, the authors propose Wasserstein Policy Regularization (WPR), the first approach to integrate entropy-regularized Wasserstein distance into the RLHF framework. By leveraging the geometric structure of the token space, WPR enables semantic-aware policy optimization. Through its dual formulation, the proposed regularizer is efficiently transformed into a computable penalty term on the reward function. Experiments demonstrate that WPR significantly outperforms KL divergence and other f-divergence baselines across multiple alignment tasks, confirming the effectiveness of semantic-aware policy distance in enhancing model alignment.