Challenge: Existing methods for generating reward models focus on outcome-level supervision, neglecting analytical process quality, which constrains their potential.
Approach: They propose a novel reward model that leverages self-reflection to assess analytical quality and enhance preference modeling.
Outcome: The proposed model improves performance on four benchmarks and significantly mitigates positional bias.

Similar Papers

ConsistRM: Improving Generative Reward Models via Consistency-Aware Self-Training (2026.acl-long)

Copied to clipboard

Challenge: ConsistRM is a self-training framework that enables effective and stable GRM training without human annotations.
Approach: They propose a self-training framework that enables effective and stable GRM training without human annotations.
Outcome: The proposed framework outperforms vanilla Reinforcement Fine-Tuning (RFT) by 1.5% on five benchmark datasets.
Self-Generated Critiques Boost Reward Modeling for Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Existing reward models produce scalar scores and struggle to incorporate critiques in a natural language format.
Approach: They propose a framework that predicts critiques and rewards using self-generated critiques without extra supervision.
Outcome: The proposed framework improves reward modeling accuracy by 3.7%-7.3% compared to standard reward models and LLM judges.
Structural Reward Model: Enhancing Interpretability, Efficiency, and Scalability in Reward Modeling (2025.emnlp-industry)

Copied to clipboard

Challenge: Generative RMs (GRMs) lack contextual and background information during inference, leading to incomplete evaluations.
Approach: They propose a modular and interpretable framework that integrates side-branch models as auxiliary feature generators.
Outcome: The proposed framework outperforms scalar and saline reward models in robustness and alignment with human preferences.
ToolRM: Towards Agentic Tool-Use Reward Modeling (2026.findings-acl)

Copied to clipboard

Challenge: lack of reliable reward models for tool-use tasks has limited progress toward agentic AI . recent advances in agentic artificial intelligence are driven by tool-using capabilities of large language models.
Approach: They propose a pipeline that constructs pairwise preference data using rule-based scoring and multidimensional sampling to build lightweight reward models.
Outcome: The proposed model outperforms existing models on tool calling tasks with higher accuracy.
DARM: Distribution-Aware Reward Modeling by Alleviating Biases from Low Preference-Context Dependency Data (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for training reward models are vulnerable to context neglect and degraded accuracy.
Approach: They propose distribution-aware reward modeling that augments the RM objective with a conditional mutual information regularizer that maximizes context and the predicted reward conditioned on the response.
Outcome: The proposed model improves performance in RLHF and improves accuracy in other settings.
PaTaRM: Bridging Pairwise and Pointwise Signals via Preference-Aware Task-Adaptive Reward Modeling (2026.acl-long)

Copied to clipboard

Challenge: Existing reward models lack generative and reasoning capabilities, resulting in poor performance.
Approach: They propose a reward-aware task-adaptive reward model that enables pointwise training using readily available pairwise data via a novel Preference-Aware Reward mechanism.
Outcome: The proposed reward model achieves an average relative improvement of 8.7% over the base models on RewardBench and RMBench.
OpenRubrics: Towards Scalable Synthetic Rubric Generation for Reward Modeling and LLM Alignment (2026.acl-long)

Copied to clipboard

Challenge: Existing reward models rely on scalar or pairwise judgments that fail to capture multifaceted nature of human preferences.
Approach: They propose a rubric-based reward model that uses a large collection of prompt, rubric pairs to generate a scalar score or preference label for each response.
Outcome: The proposed model surpasses strong size-matched baselines by 8.4% across multiple benchmarks.
DUAL RM: Beyond Rule-based Preference Reward Modeling via Meta-Reward (2026.acl-long)

Copied to clipboard

Challenge: Existing preference-based reward modeling methods face a recursive dependency where each verifier requires a meta-verifier, leading to continuous and costly dependence on human annotation.
Approach: They propose a dual RM that couples discriminative and generative reward models under a non-parametric meta-reward.
Outcome: The proposed model achieves strong performance across major preference benchmarks and even when trained exclusively on language modality, it exhibits robust cross-modal transfer on Omni-RewardBench.
APLOT: Robust Reward Modeling via Adaptive Preference Learning with Optimal Transport (2025.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that RLHF improves performance of Large Language Models . BT-based RMs struggle to distinguish between similar preference responses .
Approach: They propose to enhance BT-based reward models by using an adaptive margin mechanism . they use semantic similarity and reward-predicted reward differences to adjust focus .
Outcome: Experimental results show that the proposed method outperforms existing methods in both in-distribution and OOD settings.
RED: Unleashing Token-Level Rewards from Holistic Feedback via Reward Redistribution (2025.emnlp-main)

Copied to clipboard

Challenge: Experimental results demonstrate the superiority of our approach to aligning large language models with human preferences.
Approach: They propose a method that evaluates and assigns specific credit to each token using an off-the-shelf reward model.
Outcome: The proposed method evaluates and assigns specific credit to each token using an off-the-shelf reward model.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations