Beyond Correctness: Confidence-Aware Reward Modeling for Enhancing Large Language Model Reasoning

Qianxi He, Qingyu Ren, Shanzhe Lei, Xuhong Wang, Yingchun Wang
11/9/2025
cs.AIcs.LG

Official code: qianxiHe147/C2RM (3 stars, last commit 2025-11-09).

Abstract

Recent advancements in large language models (LLMs) have shifted the post-training paradigm from traditional instruction tuning and human preference alignment toward reinforcement learning (RL) focused on reasoning capabilities. However, numerous technical reports indicate that purely rule-based reward RL frequently results in poor-quality reasoning chains or inconsistencies between reasoning processes and final answers, particularly when the base model is of smaller scale. During the RL exploration process, models might employ low-quality reasoning chains due to the lack of knowledge, occasionally producing correct answers randomly and receiving rewards based on established rule-based judges. This constrains the potential for resource-limited organizations to conduct direct reinforcement learning training on smaller-scale models. We propose a novel confidence-based reward model tailored for enhancing STEM reasoning capabilities. Unlike conventional approaches, our model penalizes not only incorrect answers but also low-confidence correct responses, thereby promoting more robust and logically consistent reasoning. We validate the effectiveness of our approach through static evaluations, Best-of-N inference tests, and PPO-based RL training. Our method outperforms several state-of-the-art open-source reward models across diverse STEM benchmarks. We release our codes and model in https://github.com/qianxiHe147/C2RM.

View on arXivView PDF

Code Implementations(1)

qianxiHe147/C2RMOfficial100%
31PythonMay 20, 202511 months ago

Similar Papers

Cite this paper

@article{he2025beyond,
  title  = {Beyond Correctness: Confidence-Aware Reward Modeling for Enhancing Large Language Model Reasoning},
  author = {Qianxi He and Qingyu Ren and Shanzhe Lei and Xuhong Wang and Yingchun Wang},
  year   = {2025},
  eprint = {2511.07483},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.07483v1}
}

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/2511.07483.svg)](https://codeofpaper.com/paper/2511.07483)

Discussion