Improving Value-based Process Verifier via Low-Cost Variance Reduction
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have achieved remarkable success in a wide range of tasks. However, their reasoning capabilities, particularly in complex domains like mathematics, remain a significant challenge. Value-based process verifiers, which estimate the probability of a partial reasoning chain leading to a correct solution, are a promising approach for improving reasoning. Nevertheless, their effectiveness is often hindered by estimation error in their training annotations, a consequence of the limited number of Monte Carlo (MC) samples feasible due to the high cost of LLM inference. In this paper, we identify that the estimation error primarily arises from high variance rather than bias, and the MC estimator is a Minimum Variance Unbiased Estimator (MVUE). To address the problem, we propose the textscCompound textscMonte textscCarlo textscSampling (ComMCS) method, which constructs an unbiased estimator by linearly combining the MC estimators from the current and subsequent steps. Theoretically, we show that our method leads to a predictable reduction in variance, while maintaining an unbiased estimation without additional LLM inference cost. We also perform empirical experiments on the MATH-500 and GSM8K benchmarks to demonstrate the effectiveness of our method. Notably, ComMCS outperforms regression-based optimization method by 2.8 points, the non-variance-reduced baseline by 2.2 points on MATH-500 on Best-of-32 sampling experiment.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 18 references that are in the map. First posted on arXiv 14 Aug 2025.
Builds on
13 of 18 references.
References · 13
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Let's Verify Step by Stepcited by 3,598
- 2022Inner Monologue: Embodied Reasoning through Planning with Language Modelscited by 1,057
- 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 895
- 2022Solving math word problems with process- and outcome-based feedbackcited by 871
- 2024Generative Verifiers: Reward Modeling as Next-Token Predictioncited by 465
- 2024Improve Mathematical Reasoning in Language Models by Automated Process Supervisioncited by 426
- 2025The Lessons of Developing Process Reward Models in Mathematical Reasoningcited by 402
- 2024ProcessBench: Identifying Process Errors in Mathematical Reasoningcited by 277
- 2022Making Large Language Models Better Reasoners with Step-Aware Verifiercited by 231
- 2022Teaching Algorithmic Reasoning via In-context Learningcited by 111
1 more
- 2023Making Large Language Models Better Reasoners with Alignmentcited by 63
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Improving Value-based Process Verifier via Structural Prior Injection
- 2025LEMMA: Learning from Errors for MatheMatical Advancement in LLMs
- 2024Step-by-Step Reasoning for Math Problems via Twisted Sequential Monte Carlo
- 2025Enhancing Reasoning through Process Supervision with Monte Carlo Tree Search
- 2024AlphaMath Almost Zero: Process Supervision without Process
- 2024LLM2: Let Large Language Models Harness System 2 Reasoning
- 2026Improving Mathematical Reasoning Capabilities in Large Language Models via Reasoning Process Error Classification
- 2024LLMs for Mathematical Modeling: Towards Bridging the Gap between Natural and Mathematical Languages