Skip to content
Book Open access

RMEval: Bridging Reward Model Evaluation and Policy Evaluation through Ranking Consistency

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 9730-9741 · 0 citations · 20 references

Abstract

Reward Models (RMs) are widely used to guide the alignment of Large Language Models (LLMs) in Reinforcement Learning from Human Feedback (RLHF), and their quality has a substantial impact on the performance of trained policy models. In current practice, reward models are predominantly evaluated using local metrics such as pairwise accuracy on validation sets. However, recent studies have shown that the accuracy metric exhibits only weak correlation with downstream policy performance. To bridge this gap, we propose RMEval, a benchmark that revisits reward model evaluation through the lens of global ranking consistency. Specifically, we conduct the standard RLHF training to generate a sequence of policy checkpoints with progressively improving performance. We then construct our evaluation sets by sampling responses from these checkpoints, establishing a ground-truth ranking based on downstream policy evaluation. By scoring these responses with a candidate reward model, we measure the consistency between the ranking induced by the reward model and the ground-truth ranking defined by policy performance, using the consistency as our evaluative metric. Through extensive empirical analysis, we evaluate existing reward models on RMEval and demonstrate that our metric exhibits a strong correlation with downstream policy performance, with Pearson coefficients exceeding 0.6 across multiple domains.

Read PDF

Similar papers

2025

LaRes: Evolutionary Reinforcement Learning with LLM-based Adaptive Reward Search

This work proposes LaRes, a novel hybrid framework that achieves efficient policy learning through reward function search by leveraging large language models to generate the reward function population, guiding RL in policy learning.

Pengyi Li, Hongyao Tang, Jinbin Qiao et al. · 7 citations
Jul 2026

Structure-aware Relative Policy Optimization for Ranking

Experimental results across two ranking scenarios demonstrate that explicitly modeling permutation-level differences improves the effectiveness and stability of listwise ranking, with particularly favorable performance in limited-feedback and complex list-level optimization settings.

Yi-Teng Tu, Wei-Hang Su, Zi-Tao Su et al. · 0 citations
Preprint Aug 2026

RRC: Unlocking Generative Reward Models in LLM Reinforcement Learning via Ranking-Based Reward Construction

RRC introduces two complementary strategies: self-competitive ranking, which exploits comparisons among sampled responses, and anchor-guided ranking, which enables scalable ranking-based reward construction with a small set of reference responses.

Chenglong Wang, Ziming Zhu, Yifu Huo et al. · 2 citations
#natural language process... Preprint Sep 2026

ConsensusBench: Benchmark of Consensus Nodes for LLM Reasoning via Outcome Reward Densifying

This work develops a new reinforcement learning signal named ConsensusPR, which directly reduces the reward sparsity of outcome reward across long reasoning trajectories, and introduces ConsensusBench, a novel dataset designed to provide rule-based process-level signals.

Shi-Qi Yan, Chao-Hong Tan, Qian Chen et al. · 0 citations
#machine learning Preprint Sep 2026

DataFlex-RL: An Evaluation Platform for RLVR Data Policies

DataFlex-RL, an evaluation platform for comparing choices under a common GRPO recipe, is introduced, finding that changing the data policy measurably changes the training process but does not produce a reproducible improvement over uniform training.

Hao Liang, Ming-Rui Chen, Hengyi Feng et al. · 2 citations
#machine learning Preprint Sep 2026

Gradients Know What Outcomes Don't: Unlocking Reinforcement Learning for LLM Reasoning with Gradient-Aligned Rewards

Gradient-Aligned Reward (GAR), which operates in the policy's own gradient space: truncated backpropagation through the output projection layer extracts a compact gradient vector for each rollout, and cosine similarity with an expert-anchor gradient yields a dense, reasoning-aware reward with less than 9% wall-clock ov...

Le-Qi Zheng, Jin-Bo Su, Fang Niu et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.