Saved in:
| Main Authors: | , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.10756 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917138898354176 |
|---|---|
| author | Wu, Zijian Kong, Lingkai Zhang, Wenwei Gao, Songyang Gu, Yuzhe Cai, Zhongrui Ma, Tianyou Liu, Yuhong Wang, Zhi Ma, Runyuan Wang, Guangyu Li, Wei He, Conghui Lin, Dahua Chen, Kai |
| author_facet | Wu, Zijian Kong, Lingkai Zhang, Wenwei Gao, Songyang Gu, Yuzhe Cai, Zhongrui Ma, Tianyou Liu, Yuhong Wang, Zhi Ma, Runyuan Wang, Guangyu Li, Wei He, Conghui Lin, Dahua Chen, Kai |
| contents | Large language models (LLMs) have achieved significant progress in solving complex reasoning tasks by Reinforcement Learning with Verifiable Rewards (RLVR). This advancement is also inseparable from the oversight automated by reliable verifiers. However, current outcome-based verifiers (OVs) are unable to inspect the unreliable intermediate steps in the long reasoning chains of thought (CoTs). Meanwhile, current process-based verifiers (PVs) have difficulties in reliably detecting errors in the complex long CoTs, limited by the scarcity of high-quality annotations due to the prohibitive costs of human annotations. Therefore, we propose the Outcome-based Process Verifier (OPV), which verifies the rationale process of summarized outcomes from long CoTs to achieve both accurate and efficient verification and enable large-scale annotation. To empower the proposed verifier, we adopt an iterative active learning framework with expert annotations to progressively improve the verification capability of OPV with fewer annotation costs. Specifically, in each iteration, the most uncertain cases of the current best OPV are annotated and then subsequently used to train a new OPV through Rejection Fine-Tuning (RFT) and RLVR for the next round. Extensive experiments demonstrate OPV's superior performance and broad applicability. It achieves new state-of-the-art results on our held-out OPV-Bench, outperforming much larger open-source models such as Qwen3-Max-Preview with an F1 score of 83.1 compared to 76.3. Furthermore, OPV effectively detects false positives within synthetic dataset, closely align with expert assessment. When collaborating with policy models, OPV consistently yields performance gains, e.g., raising the accuracy of DeepSeek-R1-Distill-Qwen-32B from 55.2% to 73.3% on AIME2025 as the compute budget scales. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_10756 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | OPV: Outcome-based Process Verifier for Efficient Long Chain-of-Thought Verification Wu, Zijian Kong, Lingkai Zhang, Wenwei Gao, Songyang Gu, Yuzhe Cai, Zhongrui Ma, Tianyou Liu, Yuhong Wang, Zhi Ma, Runyuan Wang, Guangyu Li, Wei He, Conghui Lin, Dahua Chen, Kai Computation and Language Machine Learning Large language models (LLMs) have achieved significant progress in solving complex reasoning tasks by Reinforcement Learning with Verifiable Rewards (RLVR). This advancement is also inseparable from the oversight automated by reliable verifiers. However, current outcome-based verifiers (OVs) are unable to inspect the unreliable intermediate steps in the long reasoning chains of thought (CoTs). Meanwhile, current process-based verifiers (PVs) have difficulties in reliably detecting errors in the complex long CoTs, limited by the scarcity of high-quality annotations due to the prohibitive costs of human annotations. Therefore, we propose the Outcome-based Process Verifier (OPV), which verifies the rationale process of summarized outcomes from long CoTs to achieve both accurate and efficient verification and enable large-scale annotation. To empower the proposed verifier, we adopt an iterative active learning framework with expert annotations to progressively improve the verification capability of OPV with fewer annotation costs. Specifically, in each iteration, the most uncertain cases of the current best OPV are annotated and then subsequently used to train a new OPV through Rejection Fine-Tuning (RFT) and RLVR for the next round. Extensive experiments demonstrate OPV's superior performance and broad applicability. It achieves new state-of-the-art results on our held-out OPV-Bench, outperforming much larger open-source models such as Qwen3-Max-Preview with an F1 score of 83.1 compared to 76.3. Furthermore, OPV effectively detects false positives within synthetic dataset, closely align with expert assessment. When collaborating with policy models, OPV consistently yields performance gains, e.g., raising the accuracy of DeepSeek-R1-Distill-Qwen-32B from 55.2% to 73.3% on AIME2025 as the compute budget scales. |
| title | OPV: Outcome-based Process Verifier for Efficient Long Chain-of-Thought Verification |
| topic | Computation and Language Machine Learning |
| url | https://arxiv.org/abs/2512.10756 |