English

SafeDPO: A Simple Approach to Direct Preference Optimization with Enhanced Safety

Machine Learning 2026-03-05 v2 Artificial Intelligence

Abstract

As Large Language Models (LLMs) are increasingly deployed in real-world applications, balancing helpfulness and safety has become a central challenge. A natural approach is to incorporate safety constraints into Reinforcement Learning from Human Feedback (RLHF), where recent studies have shown promising progress. However, these methods often rely on auxiliary networks or multi-stage pipelines, thereby increasing complexity. In this work, we revisit the original safety alignment objective and show that, under mild assumptions, it admits a closed-form optimal policy. We further derive a provably equivalent and tractable objective, enabling direct optimization. Building on this insight, we propose SafeDPO, a lightweight method that preserves the optimal solution of the underlying safety-constrained objective while requiring only one additional hyperparameter and minimal modifications to existing preference-based training methods. SafeDPO eliminates the need for reward models, cost models, and online sampling, relying only on preference data and safety indicators. Despite its simplicity, SafeDPO achieves competitive safety-helpfulness trade-offs compared to existing safety alignment methods. Experiments on the PKU-SafeRLHF-30K benchmark demonstrate that SafeDPO substantially improves safety while maintaining competitive helpfulness. Ablation studies further show that the additional hyperparameter provides a flexible mechanism to enhance safety while preserving the theoretical optimum, and confirm that SafeDPO scales reliably to LLMs with up to 13B parameters. Overall, our results highlight that a simple, theory-driven objective can provide a lightweight yet effective solution for safety alignment in practice.

Keywords

Cite

@article{arxiv.2505.20065,
  title  = {SafeDPO: A Simple Approach to Direct Preference Optimization with Enhanced Safety},
  author = {Geon-Hyeong Kim and Yu Jin Kim and Byoungjip Kim and Honglak Lee and Kyunghoon Bae and Youngsoo Jang and Moontae Lee},
  journal= {arXiv preprint arXiv:2505.20065},
  year   = {2026}
}

Comments

40 pages