V1: Unifying Generation and Self-Verification for Parallel Reasoners

摘要

Test-time scaling for complex reasoning tasks shows that leveraging inference-time compute, for example by independently sampling and aggregating multiple solutions, results in significantly better task outcomes. However, a critical bottleneck is _verification_: sampling is only effective if correct solutions can be reliably identified among candidates. While existing approaches typically evaluate candidates independently via scalar scoring, we demonstrate that models are substantially stronger at **pairwise self-verification**. Leveraging this insight, we introduce **V1**, a framework that unifies generation and verification through efficient pairwise ranking. V1 comprises two components: **V1-Infer**, an uncertainty-guided algorithm using a tournament-based ranking that dynamically allocates self-verification compute to candidate pairs whose relative correctness is most uncertain; and **V1-PairRL**, an RL framework that **jointly trains** a single model as both generator and pairwise self-verifier, ensuring the verifier adapts to the generator's evolving distribution. On code generation (LiveCodeBench, CodeContests) and math reasoning (AIME, HMMT) benchmarks, V1-Infer improves Pass@1 by up to 10\% over pointwise verification and outperforms recent test-time scaling methods while being significantly more efficient. Furthermore, V1-PairRL achieves 7-9\% test-time scaling gains over standard RL and pointwise joint training, and improves base Pass@1 by up to 8.7\% over standard RL.