Unifying Stable Optimization and Reference Regularization in RLHF

Reinforcement Learning from Human Feedback (RLHF) has advanced alignment capabilities significantly but remains hindered by two core challenges: reward hacking and stable optimization. Current solutions independently address these issues through separate regularization strategies, specifically a KL-divergence penalty against a supervised fine-tuned model (π 0 ) to mitigate reward hacking, and policy ratio clipping towards the current policy (π t ) to promote stable alignment. However, the implicit trade-off arising from simultaneously regularizing towards both π 0 and π t remains under-explored. In this paper, we introduce a unified regularization approach that explicitly balances the objectives of preventing reward hacking and maintaining stable policy updates. Our simple yet principled alignment objective yields a weighted supervised fine-tuning loss with a superior trade-off, which demonstrably improves both alignment results and implementation complexity. Extensive experiments across diverse benchmarks validate that our method consistently outperforms RLHF and online preference learning methods, achieving enhanced alignment performance and stability. Our implementation is available at github.com/tmllab/2026 ICLR DAR.