RLVR trains language models to reason by rewarding correct final answers. A widely used algorithm, group-relative policy optimization (GRPO), gives every token of a solution the same credit, so dense process rewards have been proposed to credit intermediate steps, for example with a Monte-Carlo reward that scores each...
Vikash Singh, Wei-Cong Chen, Debargha Ganguly et al.· 0 citations
Post-training raises the 4B model's per-attempt accuracy and four-sample all-correct reliability and reduces average SMT calls from 4.10 to 2.52 and tokens per attempt from 18.97k to 12.72k.
Debargha Ganguly, Wei-Cong Chen, Mohsen Hariri et al.· 4 citations
This empirical study covers broad knowledge, symbolic reasoning, and competition mathematics, and it introduces an evaluation profile whose coordinates and simple functionals recover or bound common repeated-sampling metrics, and require compute accounting and uncertainty estimates that match the protocol.
Large language models can solve substantially harder reasoning problems with more inference-time compute. The term"test-time scaling,"however, now covers diverse inference algorithms that extend deliberation along a single trajectory, sample completed candidates and aggregate them through voting or verification, or sea...
Mohsen Hariri, Weicong Chen, Nahal Shahini et al.· 4 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.