Beyond VLM-Based Rewards: Diffusion-Native Latent Reward Modeling

Gongye Liu, Bo Yang, Yida Zhi, Zhizhou Zhong, Lei Ke +6 more
2/11/2026
cs.CVcs.AI

No official code found. Best implementation: HKUST-C4G/diffusion-rm (61 stars, Apache-2.0, last commit 2026-02-26).

Abstract

Preference optimization for diffusion and flow-matching models relies on reward functions that are both discriminatively robust and computationally efficient. Vision-Language Models (VLMs) have emerged as the primary reward provider, leveraging their rich multimodal priors to guide alignment. However, their computation and memory cost can be substantial, and optimizing a latent diffusion generator through a pixel-space reward introduces a domain mismatch that complicates alignment. In this paper, we propose DiNa-LRM, a diffusion-native latent reward model that formulates preference learning directly on noisy diffusion states. Our method introduces a noise-calibrated Thurstone likelihood with diffusion-noise-dependent uncertainty. DiNa-LRM leverages a pretrained latent diffusion backbone with a timestep-conditioned reward head, and supports inference-time noise ensembling, providing a diffusion-native mechanism for test-time scaling and robust rewarding. Across image alignment benchmarks, DiNa-LRM substantially outperforms existing diffusion-based reward baselines and achieves performance competitive with state-of-the-art VLMs at a fraction of the computational cost. In preference optimization, we demonstrate that DiNa-LRM improves preference optimization dynamics, enabling faster and more resource-efficient model alignment.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

The official code of "Beyond VLM-Based Rewards: Diffusion-Native Latent Reward Modeling"

613Shell, PythonFeb 11, 20267 months agoApache-2.0

Similar Papers

Cite this paper

@article{liu2026beyond,
  title  = {Beyond VLM-Based Rewards: Diffusion-Native Latent Reward Modeling},
  author = {Gongye Liu and Bo Yang and Yida Zhi and Zhizhou Zhong and Lei Ke and Didan Deng and Han Gao and Yongxiang Huang and Kaihao Zhang and Hongbo Fu and Wenhan Luo},
  year   = {2026},
  eprint = {2602.11146},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.11146v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.11146.svg)](https://codeofpaper.com/paper/2602.11146)

Discussion