betaFeedback

WorksComputer Science

Sequential Anytime Valid Tests for Efficient Inference-Time Alignment

Abstract

Inference-time alignment methods, such as Best-of-N (BoN), improve language model outputs by generating multiple candidates per prompt and selecting among them using a reward model. Much of this cost is wasted: a fixed budget is applied to every prompt, although the computation required by prompts varies widely. Adaptive methods halt once sampled answers appear settled, but their thresholds are tuned heuristics with no statistical control over early-stopping errors. We instead seek an anytime-valid stopping rule that takes an error tolerance αα as input and halts only once an answer is certified to hold a majority (θa>1/2θ_a > 1/2) under the generator's distribution. We aggregate candidates by final answer with a reward-weighted self-consistency (RWSC) score and treat stopping as a sequential test over the resulting clusters. Applying Wald's sequential probability ratio test to these clusters yields SPRT-RWSC, which performs well empirically, but its guarantee fails because the leading answer shifts during sampling, and the run is continuously monitored. Our main contribution, e-RWSC, replaces Wald's test with a betting supermartingale (an e-process) for every answer the policy produces, bounding the probability of ever certifying a non-dominant answer by αα, uniformly over time and across all answers. The RWSC scores drive the bets, so they affect only how quickly a dominant answer a⋆a^\star is certified, not validity; certification takes O(log⁡(1/α)/dKL(θa⋆∥1/2))O(\log(1/α)/d_{\mathrm{KL}}(θ_{a^\star}\|1/2)) samples. Experiments across several language models, datasets, and reward models confirm the predicted 1/dKL1/d_{\mathrm{KL}} scaling of cost and show that accuracy improves over baselines at substantially lower token cost.

Introduction

Inference-time alignment has emerged as the practical alternative to fine-tuning, in which one repeatedly generates responses from the existing language model (e.g., a policy) and selects among them. Best-of-N [2] selection scores each response with a reward model and returns the one with the highest score. Self-consistency [30] takes a majority vote over final answers. Both are effective, but expensive: their cost is NN full generations per prompt, and NN must be large enough for the hardest prompt in the workload. Since inference is the dominant cost of deployed language models, the token budget spent on selection should be minimized.

A fixed budget of NN is uniform across prompts, while the computation required by prompts varies enormously. On a prompt where the policy immediately concentrates on a single answer, ten samples are enough, whereas on a prompt on which the policy remains genuinely divided, even a thousand samples are not sufficient. Fixed-budget selection, therefore, results in both over- and underspending of tokens. Adaptive methods address this by halting generation once the sampled answers look settled, e.g., stopping when a posterior over answer frequencies concentrates [1, 28], when the marginal value of another sample falls below its cost [14], or when a budget estimated from a short burn-in is exhausted [22]. In every case, the halting rule is a tuned threshold with no control over the probability of stopping on the non-dominant answer. Moreover, they must be re-tuned for each new policy, reward model, and benchmark.

One would instead like an anytime-valid stopping rule that takes a formal error level α\alpha as input and adapts the token budget accordingly, guaranteeing that the probability of erroneously certifying a non-dominant answer (θa∗≤p†\theta_{a^\ast} \le p^\dagger) is strictly bounded by α\alpha. The rule must be defined based on a computable statistic of the generations. Since many distinct reasoning traces can yield the same final answer, we group responses by their final answers and frame the stopping rule at the answer level. We introduce Reward-Weighted Self-Consistency (RWSC), which scores each cluster by the softmax-weighted mass of its members’ reward scores, so that a cluster is favored both for containing many responses and for highly rewarded ones. Let a∗a^\ast denote the highest-scoring cluster (the leading answer) at the current step. Framing stopping as the question – is a∗a^\ast genuinely the dominant answer, or merely ahead by chance? – makes it a sequential hypothesis testing problem. Wald’s sequential probability ratio test (SPRT) is the classic solution: as each new response arrives, one accumulates evidence for or against the leader and stops once it crosses a boundary [27]. It performs strongly in practice, but remains a heuristic here, without any rigorous error-control guarantee.

Wald’s guarantee assumes hypotheses that are fixed in advance, tested by a single terminal decision, and none of these holds here. Writing θa\theta_a for the probability that a fresh response yields answer aa, the rates defining the test are estimated from the same responses the test then examines, rather than fixed beforehand. The leading answer a∗a^\ast is itself a function of the sampled responses, so the parameter under test, θa∗\theta_{a^\ast}, shifts whenever the leader does, forcing the test to restart. And the statistic is checked after every response, not at a single stopping point. Each of these voids the error control that Wald’s boundaries nominally provide. We resolve this with anytime-valid inference [23], whose guarantees hold under continuous monitoring and arbitrary stopping. We maintain a separate betting supermartingale for each final answer the policy produces, instantiating one when that answer first appears and assigning it a weight from a fixed, summable sequence. Since the weights sum to 1, they split a single error budget across answers, regardless of how many arise. Ville’s inequality [26] then bounds by α\alpha the probability that a non-dominant answer (θa≤1/2\theta_a \le1/2) is ever certified, uniformly over time and over a growing set of answers. This addresses each failure of SPRT. A change in the leading answer is irrelevant, since every answer accumulates its own evidence. Continuous monitoring is an inherent property of Ville’s inequality, so checking the boundary after each response incurs no additional cost.

Validity requires only that the bets be predictable, each computed from earlier responses before the next one is sampled. The reward model sets each bet based on the current RWSC score of the answer cluster, which buys efficiency when the scores are accurate. The gain has a precise form: under the log-optimal Kelly betting [15], evidence for a dominant answer accrues at a rate dKL(θa∥1/2)d_{\mathrm{KL}}(\theta_a\mathbin\Vert1/2), so certification takes about log⁡(1/α)/dKL(θa∥1/2)\log(1/\alpha)/d_{\mathrm{KL}}(\theta_a\mathbin\Vert1/2) sampled responses. An accurate RWSC score bets near-optimally and approaches this rate, while an inaccurate or hacked score bets poorly and slows the certification. But it never crosses the boundary in expectation under the null, since validity does not depend on the estimate being correct.

The efficiency of the stopping rule, therefore, adapts to the prompt. The number of tokens spent scales with its difficulty: an answer the policy strongly favors (θa>1/2\theta_a > 1/2) is certified in a few responses, whereas one near the decision boundary θa=1/2\theta_a = 1/2 takes many, often more than the budget allows, in which case the procedure certifies nothing and falls back to standard aggregation. Either way, the practitioner fixes the error-control probability α\alpha once, and the number of responses adjusts itself to each prompt. We summarize our contributions as follows.

(i) We cast early stopping as a sequential hypothesis-testing problem and introduce SPRT-RWSC, which applies Wald’s test to determine when the leading answer has converged. It operates on Reward-Weighted Self-Consistency (RWSC): an answer-level aggregation rule that scores answer clusters by reward-weighted mass, and recovers majority voting and Best-of-NN as extreme cases. It works well in practice, but Wald’s error guarantee does not hold in this setting (Section 2).

(ii) We propose E-RWSC, an anytime-valid stopping rule that accumulates evidence over all answers through separate e-processes. It controls the Type-I error (certifying an answer that is not dominant under the policy) at a user-specified level α\alpha, uniformly over time, and over an unknown set of answers. The guarantee holds for any predictable choice of bets, so the reward model, which sets them through RWSC scores, governs only efficiency and never validity. Under a plug-in estimate of the log-optimal Kelly betting, certifying the dominant answer (when one exists) takes O(log⁡(1/α)/dKL(θa∗∥1/2))O(\log(1/\alpha)/d_{\mathrm{KL}}(\theta_{a^*}\Vert1/2)) responses as α→0\alpha\to0. So, the number of tokens spent scales with the prompt’s difficulty (§ 3).

(iii) An empirical study on 5 Language Models (Qwen2.5-3B, Qwen2.5-7B, Llama-3-8B, Phi-3-Mini-4K, Mistral-24B) with 4 Reward Models (ArmoRM, FsfairX, Skywork V1, Skywork V2) over 4 Benchmarks (GSM8K, MATH500, MMLU, CruxEval) showing that realized certification error stays below the nominal level, that per-response cost follows the predicted 1/dKL1/d_{\mathrm{KL}} scaling with prompt difficulty, and that E-RWSC matches or outperform several baselines at substantially lower average cost (§ 4). For example, with Qwen-2.5-3B as the language model, ArmoRM as the reward model, and a maximum generation budget capped at 512, on the MATH500 Benchmark, we achieve an 8.2% absolute accuracy gain over BoN with a 61.7% smaller budget.

Related work. A line of work improves which response is chosen from a pool: reward-weighted selection with a temperature [25], ensemble reward models normalized across members [8], and step-level search or process verification that refine how each candidate is generated and scored [21, 4, 5, 16]. RWSC draws on the first two but aggregates over final answers rather than individual candidates. Our contribution concerns the orthogonal question of how many candidates to generate. The adaptive stopping methods [1, 28, 14, 22, 24] share a common limitation: their halting rules are tuned thresholds resting on distributional assumptions, with no control over the probability of stopping on the wrong answer. ConSol [17], like SPRT-RWSC, applies Wald’s test to halt self-consistency generation, but compares only the top two answers and uses static priors. Two recent works give anytime-valid certificates for self-consistency: MMC [7] certifies the empirical-leader mode via paired e-processes and couples this with test-time training, and CITE [20] certifies a fixed target as the unique mode with a matching minimax lower bound. Unlike reward-agnostic mode certifiers (MMC, CITE), E-RWSC uses reward-informed betting to certify strict majority dominance (p†≥0.5p^\dagger\ge0.5), achieving 94.5% accuracy on certified early stopped answers vs. 88.9% for MMC with a lower budget.

Answer-Level Aggregation and Sequential Stopping

Given a prompt xx, a language model samples responses from a fixed reference policy πref(⋅∣x)\pi_{\mathrm{ref}}(\cdot|x). Each response yy carries a chain of reasoning terminating in a final answer, extracted by a function Ans⁡(y)\operatorname{Ans}(y) that maps yy to a canonical answer string (e.g., the final numerical result of a math problem). A reward model r(x,y)∈Rr(x,y) \in\mathbb{R} scores how good a response is. Best-of-N (BoN) samples NN responses and returns the one with the highest reward. Self-consistency ignores the reward model and returns the answer produced by the majority of responses. Scoring responses individually, as BoN does, exposes selection to reward hacking at its worst: a single anomalously scored response wins outright. Yet discarding the reward signal entirely, as self-consistency does, throws away information about response quality. Since many distinct reasoning chains reach the same final answer, we group responses at the answer level, scoring each answer group by both the number of responses it contains and the total reward it receives.

Reward-Weighted Self-Consistency

Let Y\mathcal{Y} be a pool of NN sampled responses, Ya={y∈Y:Ans⁡(y)=a}\mathcal{Y}_a = \{y \in\mathcal{Y} : \operatorname{Ans}(y) = a\} the set of responses yielding answer aa, and A={Ans⁡(y):y∈Y}\mathcal{A} = \{\operatorname{Ans}(y) : y \in\mathcal{Y}\} the set of observed answers. Reward-Weighted Self-Consistency (RWSC) assigns each group the softmax-weighted mass of its members’ rewards,

S(x,a)=∑y∈Yaexp⁡(rˉ(x,y)/τ)∑y′∈Yexp⁡(rˉ(x,y′)/τ),rˉ(x,y)=r(x,y)−μxσx,(1)S(x,a) = \sum_{y \in\mathcal{Y}_a} \frac{\exp(\bar{r}(x,y)/\tau)}{\sum_{y' \in\mathcal{Y}} \exp(\bar{r}(x,y')/\tau)}, \qquad\bar{r}(x,y) = \frac{r(x,y)-\mu_x}{\sigma_x}, \tag*{(1)}

where rˉ(x,y)\bar{r}(x,y) is the reward normalized by the pool mean μx\mu_x and standard deviation σx\sigma_x, and τ\tau is a temperature parameter. The scores form a probability distribution over A\mathcal{A}. As τ→∞\tau\to\infty, every response contributes equally, and S(x,a)S(x,a) reduces to the fraction of responses in cluster aa, yielding self-consistency. As τ→0\tau\to0, the mass concentrates on the highest-reward response, recovering BoN. Intermediate τ\tau allows the answer frequency and reward magnitude to jointly determine the winner.

RWSC returns the answer with the highest mass and, within its cluster, the highest-reward response:

a∗=arg⁡max⁡a∈AS(x,a),yRWSC∗=arg⁡max⁡y∈Ya∗r(x,y).(2)a^* = \arg\max_{a\in\mathcal{A}} S(x,a), \qquad y^*_{\mathrm{RWSC}} = \arg\max_{y\in\mathcal{Y}_{a^*}} r(x,y). \tag*{(2)}

RWSC, like BoN and self-consistency, draws a fixed NN responses per prompt. This is wasteful, since the computation a prompt requires varies by orders of magnitude, and a budget large enough for the hardest prompt overspends on easy ones. Instead, we let each prompt govern its own budget, framing the decision of when to stop as a sequential test of the convergence of RWSC clusters.

A Sequential Test over Answer Clusters

Fix a prompt xx. Let the responses y1,y2,…y_1, y_2, \ldots be drawn sequentially from πref(⋅∣x)\pi_{\mathrm{ref}}(\cdot|x). At each step nn, let Yn\mathcal{Y}_n be the pool of sampled responses, An\mathcal{A}_n the set of observed answers, Yn,a\mathcal{Y}_{n,a} the cluster for answer aa and Sn(x,a)S_n(x,a) its RWSC mass. Let an∗=arg⁡max⁡a∈AnSn(x,a)a_n^* = \arg\max_{a\in\mathcal{A}_n} S_n(x,a) be the current leader, the highest-RWSC-mass answer. For an answer aa, write θa=Py∼πref(⋅∣x)(Ans⁡(y)=a)\theta_a = \mathbb{P}_{y\sim\pi_{\mathrm{ref}}(\cdot|x)}(\operatorname{Ans}(y)=a) for its generation probability under πref\pi_{\mathrm{ref}}. Deciding when to stop amounts to determining whether the leading answer’s probability of generation is sufficiently high to declare it dominant. Each new response yn+1y_{n+1} contributes to an agreement indicator

Xn+1=1{Ans⁡(yn+1)=an∗},P(Xn+1=1∣Fn−1)=θan∗,(3)X_{n+1} = \mathbb{1}\{\operatorname{Ans}(y_{n+1}) = a_n^*\}, \qquad\mathbb{P}(X_{n+1}=1 \mid\mathcal{F}_{n-1}) = \theta_{a_n^*}, \tag*{(3)}

where Fn=σ(Yn)\mathcal{F}_n = \sigma(\mathcal{Y}_n) denotes the sigma-algebra generated by first nn responses and their reward scores. The test asks whether the agreement rate θan∗\theta_{a_n^*} is high, so that the leader an∗a_n^* has converged, or low, so that it has not. We instantiate it with Wald’s sequential probability ratio test (SPRT) [27] and call the resulting procedure SPRT-RWSC. Its pseudo-code is given in Appendix § 6.

Hypothesis test. Fix 0<p0<0.5<p1<10 < p_0 < 0.5 < p_1 < 1 and at each step nn, we test two simple hypotheses,

H0:θan∗=p0againstH1:θan∗=p1,(4)H_0:\theta_{a_n^*}=p_0 \qquad\text{against} \qquad H_1:\theta_{a_n^*}=p_1, \tag*{(4)}

where p0p_0 represents a non-convergent regime in which the leader holds only a minority of the mass and p1p_1 a regime in which it is dominant. The two rates are set per prompt from a short burn-in of n0n_0 responses (e.g. n0=4n_0=4), during which clusters are formed but no evidence is accumulated: we set p0=min⁡{1/∣An0∣,0.5−ϵ}p_0 = \min\{1/|\mathcal{A}_{n_0}|, 0.5-\epsilon\} and p1=max⁡{Sn0(x,an0∗),0.5+ϵ}p_1 = \max\{S_{n_0}(x,a_{n_0}^*), 0.5+\epsilon\} for a small ϵ∈(0,0.5)\epsilon\in(0,0.5), so that stopping always requires a strict majority. Under hypothesis HkH_k, k∈{0,1}k\in\{0,1\}, each observation has mass pkXi(1−pk)1−Xip_k^{X_i}(1-p_k)^{1-X_i}, so the cumulative log-likelihood ratio after nn responses,

Λn=log⁡(∏i=n0+1np1Xi(1−p1)1−Xip0Xi(1−p0)1−Xi)=∑i=n0+1n[Xilog⁡p1p0+(1−Xi)log⁡1−p11−p0],(5)\Lambda_n = \log\left(\prod_{i=n_0+1}^{n}\frac{p_1^{X_i}(1-p_1)^{1-X_i}}{p_0^{X_i}(1-p_0)^{1-X_i}}\right) = \sum_{i=n_0+1}^{n}\left[X_i\log\frac{p_1}{p_0}+(1-X_i)\log\frac{1-p_1}{1-p_0}\right], \tag*{(5)}

accumulates evidence for H1H_1 over H0H_0. Given target error rates α\alpha (accepting a non-dominant leader) and β\beta (rejecting a dominant one) in (0,1)(0,1), Wald’s boundaries are A=log⁡β1−αA=\log\frac{\beta}{1-\alpha} and B=log⁡1−βαB=\log\frac{1-\beta}{\alpha}. If Λn≥B\Lambda_n \ge B, the test returns the current leader an∗a_n^* as the final answer. If Λn≤A\Lambda_n \le A, it rejects the leader and resets the evidence Λn=0\Lambda_n=0. Otherwise, it draws another response, falling back to the current leader if the budget Nmax⁡N_{\max} is reached.

Shifting leader. The RWSC leader an∗a_n^* is a function of the responses and can change as we draw yn+1y_{n+1}. If the leader changes to an+1∗≠an∗a_{n+1}^* \ne a_n^*, the hypotheses—defined relative to the previous leader—no longer concern the quantity being tested, and the accumulated Λn\Lambda_n measures evidence about the wrong answer. SPRT-RWSC resets Λn=0\Lambda_n=0 and re-estimates p0,p1p_0,p_1 for the new leader with updated answer set An+1\mathcal{A}_{n+1} and leader’s RWSC mass Sn+1(x,an+1∗)S_{n+1}(x,a_{n+1}^*). Thus, the hypotheses are repeatedly redefined based on the data, allowing the test to adapt to the prompt’s difficulty.

However, one cannot control the errors here as one can with Wald’s theorem. Wald’s classical guarantee is for two known hypotheses fixed in advance, with a single terminal decision. Here, the leader shifts during the run, changing the hypotheses, and the evidence Λn\Lambda_n is compared to the boundary after every response rather than at a single stopping point. SPRT-RWSC is thus a principled and effective heuristic, with tunable parameters α\alpha, β\beta, with no guarantee on Type I and II error.

Anytime-Valid Certified Stopping

Wald’s guarantee is not designed for hypotheses that shift with the data or for a statistic inspected after every response. We therefore turn to a framework built for exactly these conditions. EE-processes ([23]) retain their validity under optional stopping, and predictable data-dependent construction. By building the test on e-processes, we control the probability of ever certifying a non-dominant answer at a user-specified level, uniformly over time.

Given a prompt xx, let An=Ans⁡(yn)A_n = \operatorname{Ans}(y_n) be the final answer of response yny_n and Xn(a)=1{An=a}X_n^{(a)} = \mathbb{1}\{A_n = a\} the indicator that response nn agrees with answer aa. Let θa\theta_a be the generation probability of answer aa. Then, Xn(a)X_n^{(a)}, n≥1n \ge1, are i.i.d. Bernoulli(θa)(\theta_a). For each answer aa, we test

H0(a):θa≤p†againstH1(a):θa>p†,(6)H_0^{(a)} : \theta_a \le p^{\dagger} \qquad\text{against} \qquad H_1^{(a)} : \theta_a > p^{\dagger}, \tag*{(6)}

where p†∈(0,1)p^{\dagger} \in(0,1) is threshold controlling dominance of an answer. Under H0(a)H_0^{(a)}, aa is not the dominant answer. Hence, rejecting H0(a)H_0^{(a)} certifies aa as dominant. When p†≥12p^{\dagger} \ge\frac{1}{2}, at most one answer can do so. So the certified answer, if it exists, is unique.

Per-answer betting e-processes. Let Xn(a)=1{An=a}X_n^{(a)} = \mathbb{1}\{A_n = a\} be the indicator that response nn agrees with answer aa and Fn(a)=σ(y1,X1(a),…,yn,Xn(a))\mathcal{F}_n^{(a)} = \sigma(y_1, X_1^{(a)}, \ldots, y_n, X_n^{(a)}) the sigma-algebra generated by the first nn responses, their reward scores, and agreement indicators with answer aa. Let (λn(a))n≥1(\lambda_n^{(a)})_{n \ge1} be a stochastic process predictable with respect to the filtration (Fn(a))n≥1(\mathcal{F}_n^{(a)})_{n \ge1}, i.e., λn(a)\lambda_n^{(a)} is Fn−1(a)\mathcal{F}_{n-1}^{(a)}-measurable. Let σa=min⁡{n:An=a}\sigma_a = \min\{n : A_n = a\} the first appearance of answer aa. Define, for n≥σan \ge\sigma_a, the stochastic process

En(a)=∏i=σa+1n(1+λi(a)(Xi(a)−p†)),Eσa(a)=1.(7)E_n^{(a)} = \prod_{i=\sigma_a+1}^{n} \left(1 + \lambda_i^{(a)}\left(X_i^{(a)} - p^{\dagger}\right)\right), \qquad E_{\sigma_a}^{(a)} = 1. \tag*{(7)}

The above admits a betting interpretation ([23]): a bettor, starting with unit capital, bets repeatedly on the event that the next candidate agrees with the answer aa, at odds set by the null θa≤p†\theta_a \le p^{\dagger}. Staking a fraction λi(a)p†\lambda_i^{(a)}p^{\dagger} of current capital returns λi(a)(1−p†)\lambda_i^{(a)}(1-p^{\dagger}) on agreement and forfeits λi(a)p†\lambda_i^{(a)}p^{\dagger} otherwise, so En(a)E_n^{(a)} is the bettor’s wealth after nn rounds.

Stopping rule. Let J(a)∈{1,2,…}J(a) \in\{1,2,\ldots\} be the rank of answer aa in order of first appearance. Assign weights πj=1j(j+1)\pi_j = \frac{1}{j(j+1)}, so that ∑j≥1πj=1\sum_{j \ge1}\pi_j = 1. Given a certification level α∈(0,1)\alpha\in(0,1), we stop generating responses at

N=min⁡{n≥1:∃a with πJ(a)En(a)≥1α}∧Nmax⁡.(8)N = \min\left\{n \ge1 : \exists a \text{ with } \pi_{J(a)}E_n^{(a)} \ge\frac{1}{\alpha}\right\} \wedge N_{\max}. \tag*{(8)}

If some answer a∗a^* triggers the boundary, it is certified, and the returned candidate is the highest-reward trajectory in its cluster, y∗=arg⁡max⁡y∈Ya∗r(x,y)y^* = \arg\max_{y \in\mathcal{Y}_{a^*}} r(x,y). If the budget Nmax⁡N_{\max} is exhausted first, the procedure falls back to uncertified RWSC selection (equation (2)).

Theorem 1 (Anytime-valid certification). Fix α\alpha, p†p^{\dagger}, c∈(0,1)c \in(0,1). For any answer distribution {θa}a\{\theta_a\}_a, any budget Nmax⁡∈N∪{∞}N_{\max} \in\mathbb{N} \cup\{\infty\}, and any predictable sequence of bets (λi(a))i,a⊂[0,c/p†](\lambda_i^{(a)})_{i,a} \subset[0,c/p^{\dagger}],

P(∃n, ∃a with θa≤p†:a is certified at time n)≤α.(9)\mathbb{P}\left(\exists n,\ \exists a \text{ with } \theta_a \le p^{\dagger} : a \text{ is certified at time } n\right) \le\alpha. \tag*{(9)}

Equivalently, with probability greater than 1−α1-\alpha, uniformly over all nn and over all answers aa such that aa is certified at time nn, satisfies θa>p†\theta_a > p^{\dagger}.

Proof sketch. Certification of answer aa occurs when the bettor’s wealth reaches 1/(πJ(a)α)1/(\pi_{J(a)}\alpha). For an answer that is not dominant (θa≤p†\theta_a \le p^{\dagger}), En(a)E_n^{(a)} is a nonnegative supermartingale, so by Ville’s inequality, it attains this level with probability at most πJ(a)α\pi_{J(a)}\alpha. Summing the weights πJ(a)\pi_{J(a)} over answers bounds the overall probability of ever certifying a non-dominant answer by α\alpha. A complete proof is given in Appendix § 7.

Remark 1. The bets enter Theorem 1 only through their range and predictability; they may depend arbitrarily on past responses and rewards, so the reward model cannot affect the certificate’s validity. A change in the RWSC leader is likewise immaterial: each answer accumulates evidence in its own e-process, so no statistic is invalidated or discarded when the leader shifts. Finally, Theorem 1 certifies dominance under the policy, θa∗>p†\theta_{a^*} > p^{\dagger}, not correctness: a confidently mistaken policy is certified quickly on a wrong answer. What links certification to accuracy is the self-consistency premise that the majority vote is usually correct, which we verify empirically (§ 4).

Reward-informed betting

We now turn to that efficiency: given the freedom to choose any predictable bet, which choice certifies the dominant answer fastest, and how does the reward model inform that choice? Since the wealth En(a)E_n^{(a)} compounds multiplicatively, the natural efficiency criterion is the growth rate 1nlog⁡En(a)\frac{1}{n}\log E_n^{(a)}, and the bet maximizing it is the classical Kelly bet [15, 3].

Lemma 1 (Kelly bet). Let X∼Bernoulli⁡(θ)X \sim\operatorname{Bernoulli}(\theta) and λ∈[0,c/p†]\lambda\in[0,c/p^\dagger] for c∈(0,1)c \in(0,1). Let Gθ(λ)=E[log⁡(1+λ(X−p†))]G_\theta(\lambda) = \mathbb{E}[\log(1+\lambda(X-p^\dagger))] be the expected one-step log-increment in wealth. Then GθG_\theta is strictly concave, and its unconstrained maximizer is the Kelly bet λ∗(θ)=θ−p†p†(1−p†)\lambda^*(\theta)=\frac{\theta-p^\dagger}{p^\dagger(1-p^\dagger)}. When admissible, i.e. λ∗(θ)≤c/p†\lambda^*(\theta) \le c/p^\dagger, it attains the growth rate Gθ(λ∗(θ))=dKL(θ∥p†)G_\theta(\lambda^*(\theta))=d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger).

Applied to answer aa, the numerator of the bet is the bettor’s edge over null, and the denominator is the variance of evidence under null. So the optimal stake is proportional to the signal-to-noise ratio of the evidence, and it is non-positive exactly when θa≤p†\theta_a \le p^\dagger, where no favorable wager exists. Maximizing expected log wealth, rather than expected wealth, is necessary: expected wealth is maximized by the all-in bet λ=1/p†\lambda=1/p^\dagger, which collapses the wealth En(a)E_n^{(a)} to zero on the first disagreement and cannot recover. Restricting to λ≤c/p†\lambda\le c/p^\dagger with c<1c<1 rules this out: every step then multiplies the wealth by at least 1−c>01-c>0, so a disagreement shrinks En(a)E_n^{(a)} but never collapses it, and the Kelly bet λ∗(θa)\lambda^*(\theta_a) within this range maximizes the growth rate Gθa(λ)G_{\theta_a}(\lambda). When the bet is admissible, its growth rate is the KL-divergence between true and null agreement rates: evidence accrues at a rate equal to the statistical distinguishability of the two hypotheses. It matches the classical efficiency of Wald’s SPRT [27] while retaining validity under composite nulls and optional stopping.

Plug-in bets. The Kelly bet depends on the unknown generation probability θa\theta_a and so cannot be played. Instead, we form a predictable estimate of θa\theta_a from the responses and their rewards observed so far. At each step n≥σa+1n \ge\sigma_a+1, where σa\sigma_a is the first appearance of answer aa, we play the bet

λn(a)=clip⁡(θ^n−1(a)−p†p†(1−p†),0,cp†),whereθ^n−1(a)=Zn−1(a)+mSn−1(x,a)(n−1−σa)+m.(10)\lambda_n^{(a)}=\operatorname{clip}\left(\frac{\widehat{\theta}_{n-1}^{(a)}-p^\dagger}{p^\dagger(1-p^\dagger)},0,\frac{c}{p^\dagger}\right), \qquad\text{where}\qquad\widehat{\theta}_{n-1}^{(a)}=\frac{Z_{n-1}^{(a)}+mS_{n-1}(x,a)}{(n-1-\sigma_a)+m}. \tag*{(10)}

Here Zn−1(a)=∑j=σa+1n−1Xj(a)Z_{n-1}^{(a)}=\sum_{j=\sigma_a+1}^{n-1}X_j^{(a)} denotes the number of agreements it accrued since its appearance, and hence the empirical agreement rate Zn−1(a)/(n−1−σa)Z_{n-1}^{(a)}/(n-1-\sigma_a) serves as an estimate of θa\theta_a. We use a regularized estimator, where the current RWSC mass Sn−1(x,a)S_{n-1}(x,a) of its cluster (equation 1) acts as a prior pseudo-observation of strength mm (we use m=4m=4). The reward model enters the bet and, consequently, the test through the RWSC mass. We call this procedure E-RWSC. Its pseudo-code is given in Appendix A.

The clip keeps the bet in the admissible range [0,c/p†][0,c/p^\dagger]. Informative reward scores steer θ^n(a)\widehat{\theta}_n^{(a)} toward θa\theta_a early, sharpening the bets and accelerating certification; miscalibrated scores merely slow the growth of capital and cost efficiency, without affecting validity, since Theorem 1 holds for any predictable bet. Proposition 1 makes this precise, giving the asymptotic growth rate of the capital and the resulting certification time under the plug-in bet.

Proposition 1 (Growth rate and certification time). Let Nmax⁡∈N∪{∞}N_{\max}\in\mathbb{N}\cup\{\infty\}, θa∗>p†\theta_{a^*}>p^\dagger for an answer a∗a^* and the Kelly bet λ∗(θa∗)≤c/p†\lambda^*(\theta_{a^*})\le c/p^\dagger for c∈(0,1)c\in(0,1). Then, as n→∞n\to\infty, the plug-in bet λn(a∗)→λ∗(θa∗)\lambda_n^{(a^*)}\to\lambda^*(\theta_{a^*}), and the capital 1nlog⁡En(a∗)→dKL(θa∗∥p†)\frac{1}{n}\log E_n^{(a^*)}\to d_{\mathrm{KL}}(\theta_{a^*}\mathbin\Vert p^\dagger), almost surely. Let Na∗(α)=min⁡{n:πJ(a∗)En(a∗)≥1/α}N_{a^*}(\alpha)=\min\{n:\pi_{J(a^*)}E_n^{(a^*)}\ge1/\alpha\} be the time at which a∗a^* is certified. Then Na∗(α)<∞N_{a^*}(\alpha)<\infty and as α→0\alpha\to0, Na∗(α)log⁡(1/α)→1dKL(θa∗∥p†)\frac{N_{a^*}(\alpha)}{\log(1/\alpha)}\to\frac{1}{d_{\mathrm{KL}}(\theta_{a^*}\mathbin\Vert p^\dagger)} almost surely. Moreover, when p†≥12p^\dagger\ge\frac{1}{2}, the stopping time NN of equation 8 coincides with Na∗(α)N_{a^*}(\alpha) except on an event of probability at most α\alpha. Consequently N/log⁡(1/α)→1/dKL(θa∗∥p†)N/\log(1/\alpha)\to1/d_{\mathrm{KL}}(\theta_{a^*}\mathbin\Vert p^\dagger) in probability as α→0\alpha\to0.

Proposition 1 says that E-RWSC certifies a dominant answer in about log⁡(1/α)/dKL(θa∗∥p†)\log(1/\alpha)/d_{\mathrm{KL}}(\theta_{a^*}\mathbin\Vert p^\dagger) responses: the cost grows only logarithmically in the confidence 1/α1/\alpha and decreases inversely with dKL(θa∗∥p†)d_{\mathrm{KL}}(\theta_{a^*}\mathbin\Vert p^\dagger), which measures how far the answer’s mass sits above the threshold p†p^\dagger. Easy prompts, where one answer clearly dominates, are certified in a handful of responses; near-ties cost many, so computational cost adapts automatically to prompt difficulty. This rate is essentially the best attainable. Ota et al. [20] proves a lower bound of the same order for sequential mode certification under self-consistency, where the sample complexity is governed by the margin between the target answer and its closest competitor. Instead, E-RWSC certifies that the returned answer holds an absolute majority, θa>12\theta_a > \frac{1}{2} – stronger than being the mode – with governing quantity dKL(θa∥12)d_{\mathrm{KL}}(\theta_a\Vert\frac{1}{2}). The rate transfers to the stopping time NN of the test (equation 8) in probability. Proof is in Appendix § 7.

Remark 2. Ota et al. [20] certify self-consistency by an intersection-union test (CITE), with a confidence-weighted variant in which each vote carries a weight. Here, the weight enters the certified object, so a poor weight changes what is certified. In E-RWSC, the reward model enters only the bets, leaving the certified event θa>12\theta_a > \frac{1}{2} fixed, so a poor reward can only slow certification, never invalidate it. More importantly, CITE fixes the target in advance, whereas E-RWSC runs per-answer e-processes and certifies whichever answer crosses first, uniformly over the growing answer set. Empirically, E-RWSC achieves higher accuracy at a lower average token cost than CITE.

Experiments

To evaluate the efficacy and generalizability of our proposed E-SPRT framework, we conduct experiments across four datasets. We utilize GSM8K (Cobbe et al., [6]) and MATH500 (Hendrycks et al., [13]) to assess multi-step mathematical reasoning. To evaluate broad domain knowledge and academic reasoning, we benchmark on MMLU (Hendrycks et al., [12]). We test the framework’s capability in code reasoning and execution tracking using the CruxEval benchmark (Gu et al., [11]). The generation capabilities of our framework were analyzed across four distinct base language models: Qwen2.5-3B, Qwen2.5-7B, Llama-3-8B, and Phi-3-Mini-4K. To evaluate the generated reasoning paths, we utilized a diverse ensemble of four reward models: ArmoRM (Wang et al., [29]), Skywork V1 (Liu et al., [18]) and V2 (Liu et al., [19]), and FsfairX (Dong et al., [9]).

Comparison with Baselines. Figure 1 (a) compares RWSC against full-budget baselines and Figure 1 (b) compares our framework SPRT-RWSC and E-RWSC against early-stopping baselines with Nmax⁡=24N_{\max} = 24. Across all evaluated tasks, RWSC consistently outperforms all full-budget baselines, achieving up to a 6% accuracy improvement over Vanilla BoN on CruxEval. Among sequential methods, AdaBoN (Raman et al., [22]) maintains baseline accuracy but fails to meaningfully reduce compute, consistently requiring ∼\sim18–19 candidates on average. In contrast, SPRT-RWSC and E-RWSC successfully cut the required budget nearly in half (∼\sim11–17 candidates) while simultaneously matching or strictly exceeding the accuracy of full-budget baselines. As highlighted by the shaded dominance regions in Figure 1 (b), our methods, E-RWSC and SPRT-RWSC, consistently achieve the optimal Pareto frontier, outperforming CITE on both accuracy and budget reduction over 3 benchmarks and demonstrating a superior balance between alignment quality and computational efficiency. For a more detailed comparison with all the baselines, refer to Table 4 in the appendix.

Comparison of full-budget baselines accuracy and early-stopping Pareto frontiers across GSM8K, MATH500, MMLU and CruxEval

Figure 1. Comprehensive comparison of all selection methods across GSM8K, MATH500, MMLU and CruxEval for Qwen2.5-3B-Instruct using ArmoRM reward model, with allowed maximum budget as 24. For E-Process methods, we use α=0.1\alpha= 0.1, p†=0.5p^\dagger= 0.5, and c=0.8c = 0.8. For SPRT we use α=0.1\alpha=0.1, β=0.2\beta=0.2.

MethodGSM8K AccGSM8K BudgetMATH500 AccMATH500 BudgetMMLU AccMMLU BudgetCruxEval AccCruxEval Budget
Oracle@24 (Hard Ceiling)96.5%24.0090.2%24.0093.4%24.0076.5%24.00
Full Budget Baselines
Base Policy (πref\pi_{\mathrm{ref}})81.1%24.0063.6%24.0065.8%24.0044.0%24.00
Vanilla BoN91.2%24.0071.0%24.0074.6%24.0048.6%24.00
Soft BoN89.1%24.0069.4%24.0070.0%24.0046.8%24.00
Answer-Level Aggregation
Self-Consistency89.8%24.0074.8%24.0070.4%24.0054.4%24.00
RWSC91.4%24.0074.2%24.0074.7%24.0054.6%24.00
Early-stopping Baselines
Pandora’s Box BoN88.1%4.00±0.004.00\pm0.0068.6%4.00±0.004.00\pm0.0073.4%4.00±0.004.00\pm0.0049.4%4.00±0.004.00\pm0.00
AdaBoN91.3%18.25±5.9018.25\pm5.9071.4%18.82±5.2018.82\pm5.2074.8%18.89±5.4818.89\pm5.4848.8%19.37±5.2419.37\pm5.24
BEACON91.3%22.06±5.1622.06\pm5.1670.8%22.55±4.2722.55\pm4.2774.6%22.26±4.7422.26\pm4.7448.5%23.16±3.2223.16\pm3.22
ConSol88.0%5.53±4.815.53\pm4.8175.4%8.02±7.388.02\pm7.3871.8%5.39±4.565.39\pm4.5654.1%11.99±8.5011.99\pm8.50
CITE87.9%21.91±2.7221.91\pm2.7275.4%21.68±2.8521.68\pm2.8572.2%21.60±2.8521.60\pm2.8554.4%23.31±1.8123.31\pm1.81
MMC87.9%17.63±3.5717.63\pm3.5775.4%19.50±7.4919.50\pm7.4972.2%17.71±8.1117.71\pm8.1154.4%19.53±7.3819.53\pm7.38
Proposed Methods
SPRT-RWSC91.1%11.48±6.1111.48\pm6.1174.6%13.23±7.3013.23\pm7.3074.5%12.38±6.9712.38\pm6.9754.8%17.17±7.0517.17\pm7.05
E-RWSC91.2%14.81±7.8214.81\pm7.8274.4%15.59±8.2015.59\pm8.2076.7%14.19±7.8614.19\pm7.8654.6%20.40±6.5420.40\pm6.54

Table 4. Comprehensive comparison of all selection methods across GSM8K, MATH500, MMLU and CruxEval for Qwen2.5-3B-Instruct using ArmoRM reward model, with allowed maximum budget as 24. For E-Process methods, we use α=0.1\alpha=0.1, p†=0.5p^{\dagger}=0.5, and c=0.8c=0.8. For SPRT we use α=0.1,β=0.2\alpha=0.1,\beta=0.2.

Cross-Model Generalization and Reward Model Sensitivity. We conduct a two-dimensional ablation on MATH500. Table 1 applies a fixed reward model (ArmoRM) across four generators (3B to 8B). While absolute performance scales with base policy strength (peaking at 81.8% for Qwen2.5-7B), SPRT-RWSC and E-RWSC consistently dominate BoN accuracy across all models, cutting inference budgets by up to 54% (less on the harder-to-converge Llama-3-8B and Phi-3-Mini-4K). Moreover, the stopping rule adapts to generator confidence, expanding budgets for uncertain models (22.45 for Llama-3-8B) and halting early for highly convergent ones (13.06 for Qwen2.5-7B). Table 2 fixes the generator (Qwen2.5-3B) to test RM sensitivity. BoN is sensitive to RM calibration, dropping to 62.6% with the weaker FsfairX RM and surging to 76.8% with Skywork V2. In contrast, RWSC and its sequential variants act as powerful regularizers against RM failures. E-RWSC maintains a robust 72.6% accuracy even with FsfairX and scales to 78.6% with Skywork V2.

MethodQwen2.5-3B AccQwen2.5-3B BudgetQwen2.5-7B AccQwen2.5-7B BudgetLlama-3-8B AccLlama-3-8B BudgetPhi-3-Mini-4K AccPhi-3-Mini-4K BudgetMistral-24B AccMistral-24B Budget
πref\pi_{\mathrm{ref}} (Base)63.6%1.0075.6%1.0026.2%1.0039.2%1.0066.2%1.00
Vanilla BoN71.0%24.0077.8%24.0032.6%24.0048.2%24.0072.0%24.00
RWSC74.2%24.0081.4%24.0039.6%24.0056.4%24.0076.8%24.00
Pandora (c=0.05c = 0.05)68.6%4.00±0.004.00 \pm0.0078.0%4.00±0.004.00 \pm0.0030.0%4.00±0.004.00 \pm0.0044.2%4.00±0.004.00 \pm0.0070.8%4.00±0.004.00 \pm0.00
AdaBoN71.4%18.82±5.2018.82 \pm5.2078.0%18.97±5.2618.97 \pm5.2632.2%18.90±5.3118.90 \pm5.3147.8%18.84±5.4818.84 \pm5.4870.8%18.67±5.7918.67 \pm5.79
BEACON70.8%22.55±4.2722.55 \pm4.2777.6%22.28±4.7022.28 \pm4.7032.0%22.39±4.5722.39 \pm4.5747.8%22.66±4.1222.66 \pm4.1272.2%22.09±4.9822.09 \pm4.98
ConSol75.4%8.02±7.388.02 \pm7.3880.8%5.91±5.995.91 \pm5.9938.6%14.69±8.3814.69 \pm8.3853.4%12.02±8.6412.02 \pm8.6476.8%7.62±7.407.62 \pm7.40
CITE (α=0.1\alpha= 0.1)75.4%21.68±2.8521.68 \pm2.8581.8%20.78±2.9220.78 \pm2.9239.0%23.74±1.1523.74 \pm1.1553.6%23.11±2.0223.11 \pm2.0277.4%21.45±2.8821.45 \pm2.88
MMC (α=0.1\alpha= 0.1)75.4%19.50±7.4919.50 \pm7.4981.6%19.94±7.1619.94 \pm7.1639.0%21.68±5.6121.68 \pm5.6153.6%20.22±6.9520.22 \pm6.9577.4%19.24±7.6419.24 \pm7.64
Ours (Proposed)
SPRT-RWSC (n0=4n_0 = 4)74.6%13.23±7.3013.23 \pm7.3081.6%11.09±6.4611.09 \pm6.4639.6%19.33±6.2819.33 \pm6.2856.6%16.70±7.2616.70 \pm7.2676.8%12.87±7.2212.87 \pm7.22
E-RWSC (α=0.1\alpha= 0.1)74.4%15.59±8.2015.59 \pm8.2081.4%13.06±7.8113.06 \pm7.8139.6%22.45±4.6322.45 \pm4.6356.4%20.16±6.7520.16 \pm6.7576.8%15.02±8.1115.02 \pm8.11

Table 1. Cross-Model Performance Comparison on MATH500 (N=24N = 24, ArmoRM).

MethodArmoRM AccArmoRM BudgetSkywork V1 AccSkywork V1 BudgetFsfairX AccFsfairX BudgetSkywork V2 AccSkywork V2 Budget
πref\pi_{\mathrm{ref}} (Base)63.6%1.0063.6%1.0063.6%1.0063.6%1.00
Vanilla BoN71.0%24.0068.6%24.0062.6%24.0076.8%24.00
RWSC74.2%24.0076.0%24.0072.8%24.0078.8%24.00
Pandora (c=0.05c = 0.05)68.6%4.00±0.004.00 \pm0.0069.0%14.91±8.2714.91 \pm8.2764.0%6.11±5.086.11 \pm5.0872.4%9.73±7.749.73 \pm7.74
AdaBoN71.4%18.82±5.2018.82 \pm5.2069.0%19.59±5.1419.59 \pm5.1463.0%19.09±5.2919.09 \pm5.2975.8%19.10±5.5619.10 \pm5.56
BEACON70.8%22.55±4.2722.55 \pm4.2769.4%21.53±5.6521.53 \pm5.6562.6%22.23±4.9122.23 \pm4.9177.2%21.77±5.4121.77 \pm5.41
ConSol75.4%8.02±7.388.02 \pm7.3875.4%8.02±7.388.02 \pm7.3875.4%8.02±7.388.02 \pm7.3875.4%8.02±7.388.02 \pm7.38
CITE (α=0.1\alpha= 0.1)75.4%21.68±2.8521.68 \pm2.8575.4%21.68±2.8521.68 \pm2.8575.4%21.68±2.8521.68 \pm2.8575.4%21.68±2.8521.68 \pm2.85
MMC (α=0.1\alpha= 0.1)75.4%19.50±7.4919.50 \pm7.4975.4%19.50±7.4919.50 \pm7.4975.4%19.50±7.4919.50 \pm7.4975.4%19.50±7.4919.50 \pm7.49
Ours (Proposed)
SPRT-RWSC (n0=4n_0 = 4)74.6%13.23±7.3013.23 \pm7.3075.8%13.61±7.5413.61 \pm7.5472.6%13.51±7.3913.51 \pm7.3978.2%12.94±7.1712.94 \pm7.17
E-RWSC (α=0.1\alpha= 0.1)74.4%15.59±8.2015.59 \pm8.2076.0%15.63±8.1915.63 \pm8.1972.6%15.65±8.2315.65 \pm8.2378.6%15.50±8.1815.50 \pm8.18

Table 2. Cross-RM Sensitivity Analysis on MATH500 (Qwen2.5-3B, N=24N = 24).

Stopping Rate and Reliability. Figure 3(a) shows that around 225 prompts out of 500 stop in less than 8 steps, whereas 174 extremely hard problems reach the maximum budget. At N=512N = 512, E-Process early stops for only 65.2% of the prompts, CITE certifies 85.8% of the prompts, whereas other methods like our SPRT-RWSC, ConSol, and Pandora’s Box BoN stop 100% of the prompts early. But among these certified early-stopped answers, E-RWSC remains highly accurate. Figure 2a decouples the accuracy of the certified early stopped answer from hard answers that exhausted the maximum budget. E-RWSC achieve 94.5% accuracy on certified answers, which is more than 5% accuracy gap as compared to the closest competitor in certified accuracy, MMC, with 88.9% accuracy, and more than 10% gap as compared to CITE with 83.7% certified accuracy.

Accuracy on stopped versus exhausted queries and decision reliability versus token footprint

Figure 2. (a) Accuracy on stopped (τ<512\tau< 512) vs. exhausted queries. (b) Decision reliability vs. overall token footprint. Figure 2: Stopping reliability and token footprint analysis on MATH500 (Nmax⁡=512N_{\max} = 512) for Qwen2.5-3B with ArmoRM. (a) E-RWSC achieves 94.5% accuracy on certified early stops (τ<512\tau< 512). (b) Decision reliability on early stops plotted against overall token expenditure (kk-tokens)

Ablation studies on MATH500

Figure 3. Ablation Studies on MATH500. (a) E-RWSC stopping distribution for Nmax⁡=512N_{\max}=512. (b) Sensitivity to Type-I error boundary α\alpha (Nmax⁡=64N_{\max}=64). (c) Sensitivity to the prior alignment threshold p†p^{\dagger} (Nmax⁡=64N_{\max}=64).

Budget scaling and prevention of premature convergence. Table 3 illustrates the scaling behavior of selection methods as the maximum allowed budget expands from N=24N = 24 to N=512N = 512. A critical failure mode, reward hacking, of BoN is exposed here: accuracy degrades at high budgets (dropping from 71.4% at N=32N = 32 to 69.8% at N=512N = 512). RWSC successfully regularizes this effect, monotonically scaling accuracy up to 77.8%. ConSol saturates early (halting at ∼12\sim12 for Nmax⁡=512N_{\max} = 512), resulting in stagnant accuracy even when the budget is much higher. In contrast, E-RWSC effectively bridges the gap between efficiency and inference scaling. It adaptively consumes more budget as Nmax⁡N_{\max} increases (from 15.6 to 196.1), selectively spending compute on highly uncertain prompts. Crucially, the early-certified subset under E-RWSC exhibits remarkable precision across all scales: certified accuracy stays near-ceiling, scaling from 99.2% at N=24N = 24 (in just 8.1 steps) to 94.5% at N=512N = 512 (27.5 steps).

MethodN=24N = 24 AccN=24N = 24 BudgetN=32N = 32 AccN=32N = 32 BudgetN=64N = 64 AccN=64N = 64 BudgetN=128N = 128 AccN=128N = 128 BudgetN=256N = 256 AccN=256N = 256 BudgetN=512N = 512 AccN=512N = 512 Budget
Vanilla BoN71.0%24.071.4%32.069.2%64.070.2%128.069.4%256.069.8%512.0
RWSC74.2%24.076.0%32.077.0%64.077.6%128.077.6%256.077.8%512.0
Pandora68.6%4.068.6%4.068.6%4.068.6%4.068.6%4.068.6%4.0
AdaBoN71.4%18.8±5.218.8 \pm5.270.6%24.8±7.324.8 \pm7.370.0%48.5±15.648.5 \pm15.670.2%95.9±32.295.9 \pm32.269.8%190.8±65.5190.8 \pm65.569.4%380.5±132.0380.5 \pm132.0
BEACON70.8%22.6±4.322.6 \pm4.371.0%29.5±6.729.5 \pm6.769.0%56.8±17.456.8 \pm17.470.4%109.7±40.4109.7 \pm40.469.6%212.9±89.1212.9 \pm89.170.0%416.5±190.0416.5 \pm190.0
CONSOL75.4%8.0±7.48.0 \pm7.474.4%8.7±9.08.7 \pm9.074.6%10.1±13.410.1 \pm13.474.8%11.2±19.011.2 \pm19.074.8%11.9±24.311.9 \pm24.374.8%12.3±29.312.3 \pm29.3
CITE75.4%21.7±2.921.7 \pm2.974.4%26.1±6.626.1 \pm6.675.6%38.4±20.238.4 \pm20.276.8%56.5±45.956.5 \pm45.977.2%84.2±93.284.2 \pm93.277.4%124.9±175.9124.9 \pm175.9
MMC75.4%20.4±6.620.4 \pm6.674.4%25.7±10.225.7 \pm10.275.6%44.1±25.544.1 \pm25.576.8%74.5±56.974.5 \pm56.977.2%127.4±117.7127.4 \pm117.777.4%217.8±238.2217.8 \pm238.2
SPRT-RWSC74.6%13.2±7.313.2 \pm7.375.8%14.8±9.814.8 \pm9.876.2%17.5±15.717.5 \pm15.776.4%18.0±17.318.0 \pm17.376.4%18.1±18.218.1 \pm18.276.4%18.1±18.218.1 \pm18.2
E-RWSC74.4%15.6±8.215.6 \pm8.276.0%19.3±12.019.3 \pm12.077.0%32.9±27.132.9 \pm27.177.8%57.9±57.057.9 \pm57.077.8%105.6±117.1105.6 \pm117.178.0%196.1±236.2196.1 \pm236.2

Table 3. MATH500 Budget Sweep Results (Qwen2.5-3B, ArmoRM)

Sensitivity to e-process parameters (α\alpha and pp†). The parameters α\alpha (Type-I error tolerance) and pp† (dominance threshold) govern the anytime-valid certification guarantee. Figure 3(b) demonstrates that E-RWSC is robust to α\alpha. The average budget decreases smoothly from 34.22 to 30.11 as α\alpha is relaxed from 0.05 to 0.4. This confirms that the practitioner can tune α\alpha to trade off statistical confidence for computational efficiency without a significant drop in accuracy. Figure 3(c) sweeps the threshold pp†. Because pp† represents the hypothesized null-agreement rate, a higher pp† demands stronger empirical consensus before the plug-in Kelly bet yields positive capital growth. Consequently, the generation budget scales monotonically with pp† (from 15.56 at pp† = 0.1 to 60.83 at pp† = 0.9). Accuracies peak broadly in the middle range (0.3 ≤p\le p† ≤0.8\le0.8), validating our default choice of pp† = 0.5 as a sound threshold for certifying a strict majority.

Compute Overhead. To test whether sequential monitoring introduces non-trivial algorithmic latency relative to raw candidate generation, we empirically benchmark the exact wall-clock latency of every pipeline component on an NVIDIA RTX 6000 Ada GPU and AMD host CPU for MATH500 (Nmax⁡=512N_{\max} = 512). Generating each candidate response (∼500\sim500 tokens with Qwen2.5-3B) requires 7,084.5 ms, and reward scoring with ArmoRM requires 59.8 ms, totaling 7,144.3 ms of GPU compute per candidate. The CPU algorithmic overhead of E-RWSC for updating the e-process and evaluating the predictable Kelly bet across semantic clusters requires merely 13.96 μ\mus (0.014 ms) per step. Across an entire adaptive query run (τˉ=196.1\bar{\tau} = 196.1), the cumulative algorithmic overhead is only 2.74 ms, representing less than 0.0002% of GPU computation time (14×\times faster than CITE’s 194.3 μ\mus confidence-interval check). Full hardware profiles and baseline comparisons are detailed in Appendix § 9.

Empirical validation of theoretical results.

We empirically validate E-RWSC theoretical guarantees in Figure 4 under dominance threshold p†=0.5p^{\dagger}=0.5 (majority dominance). First, we validate the anytime-valid certification bound (Theorem 1) by sweeping the Type-I error rate α\alpha and measuring the realized error rate of E-RWSC. Following Theorem 1, an error event occurs if an answer a∗a^{*} is certified at stopping time nn, but its underlying generation probability satisfies θa∗≤p†\theta_{a^{*}}\leq p^{\dagger}; we evaluate this empirically using the candidate frequency across the full N=512N=512 budget as an empirical estimate θ^a\hat{\theta}_{a}. As shown in Figure 4 (Top), the realized error rate remains strictly below the permitted threshold α\alpha across all nominal levels (empirically ≤0.4%\leq0.4\%, with 0.0%0.0\% for all α≤0.40\alpha\leq0.40 and mean consensus ≈90%\approx90\%), directly validating the finite-sample anytime-valid boundary.

Empirical validation of E-RWSC theoretical bounds

Figure 4. Empirical validation of E-RWSC theoretical bounds. (Top) Realized error rate respects the Type-I error (α\alpha) threshold. (Bottom) The inverse of signal strength versus stopping step shows a linear relationship.

Second, we validate Proposition 1, which governs the asymptotic growth rate of evidence. The theory states that the expected number of steps to stop scales with the inverse Kullback-Leibler divergence 1/dKL(θ^∥p†)1/d_{\mathrm{KL}}(\hat{\theta}\|p^{\dagger}) between the empirical answer distribution and the null hypothesis. As shown in the bottom panel, there is a linear relationship between the inverse of the signal strength and the stopping time NN, confirming that our thresholding effectively controls the early-stopping budget, which is proportional to the prompt’s inherent difficulty.

Conclusion

We introduced Reward-Weighted Self-Consistency (RWSC), an answer-level aggregation rule spanning Best-of-NN and self-consistency, and cast the question of how many candidates a prompt needs as a sequential test over its clusters: Wald’s SPRT applied to RWSC works well empirically but cannot guarantee its error rate under a shifting leader, so we introduce with E-RWSC, which maintains a betting e-process per answer and bounds the probability of ever certifying a non-dominant answer by α\alpha for any predictable bets, at the minimax-optimal O(log⁡(1/α)/dKL(θa∥p†))O(\log(1/\alpha)/d_{\mathrm{KL}}(\theta_{a}\|p^{\dagger})) rate under Kelly betting. Across four models, four reward models, and four benchmarks, e-RWSC matches or exceeds Best-of-NN accuracy at substantially reduced cost (e.g., 8.2% higher than Vanilla BoN with 61.7% less budget on MATH500), with realized error and per-response cost tracking these bounds empirically. The main caveat is that certification guarantees policy dominance, θa>p†\theta_{a}>p^{\dagger}, not factual correctness, so a confidently wrong policy is certified just as fast as a correct one.

Pseudocodes

Algorithm 1 SPRT-RWSC

Require: prompt xx; policy πref\pi_{\mathrm{ref}}; reward model rr; errors α,β\alpha,\beta; budget Nmax⁡N_{\max}; burn-in n0n_0

  1. A←log⁡(β1−α)A \leftarrow\log\left(\frac{\beta}{1-\alpha}\right); B←log⁡(1−βα)B \leftarrow\log\left(\frac{1-\beta}{\alpha}\right)

  2. Generate candidates y1,…,yn0∼πref(⋅∣x)y_1,\ldots,y_{n_0}\sim\pi_{\mathrm{ref}}(\cdot\mid x); A←{Ans⁡(yi)}i=1n0A\leftarrow\{\operatorname{Ans}(y_i)\}_{i=1}^{n_0} ▷ Burn-in phase

  3. Construct initial answer clusters and RWSC masses Sn0(x,⋅)S_{n_0}(x,\cdot)

  4. a∗←arg⁡max⁡a∈ASn0(x,a)a^* \leftarrow\arg\max_{a\in A} S_{n_0}(x,a) ▷ Identify initial leader

  5. Λ←0\Lambda\leftarrow0; set p0,p1p_0,p_1 ▷ Initialize Log-Likelihood Ratio

  6. for n=n0+1,…,Nmax⁡n=n_0+1,\ldots,N_{\max} do

  7. Sample yn∼πref(⋅∣x)y_n\sim\pi_{\mathrm{ref}}(\cdot\mid x); An←Ans⁡(yn)A_n\leftarrow\operatorname{Ans}(y_n); A←A∪{An}A\leftarrow A\cup\{A_n\}

  8. Update answer clusters and RWSC masses Sn(x,⋅)S_n(x,\cdot) over y1:ny_{1:n}

  9. anew←arg⁡max⁡a∈ASn(x,a)a_{\mathrm{new}}\leftarrow\arg\max_{a\in A}S_n(x,a) ▷ Identify current leader

  10. if anew≠a∗a_{\mathrm{new}}\ne a^* then ▷ Leader Shift

  11. a∗←anewa^*\leftarrow a_{\mathrm{new}}; Λ←0\Lambda\leftarrow0; Update p0,p1p_0,p_1

  12. else

  13. X←1{An=a∗}X\leftarrow\mathbf{1}\{A_n=a^*\} ▷ Check for agreement

  14. ΔΛ←Xlog⁡(p1p0)+(1−X)log⁡(1−p11−p0)\Delta\Lambda\leftarrow X\log\left(\frac{p_1}{p_0}\right)+(1-X)\log\left(\frac{1-p_1}{1-p_0}\right); Λ←Λ+ΔΛ\Lambda\leftarrow\Lambda+\Delta\Lambda

  15. if Λ≥B\Lambda\ge B then ▷ Accept H1H_1

  16. return a∗a^* ▷ Stop early and return leader

  17. else if Λ≤A\Lambda\le A then ▷ Reject H1H_1

  18. Λ←0\Lambda\leftarrow0; Update p0,p1p_0,p_1 ▷ Reset evidence and track new trend

  19. end if

  20. end if

  21. end for

  22. return a∗a^* ▷ Budget exhausted, return current leader

Algorithm 2 E-RWSC

Require: prompt xx; policy πref\pi_{\mathrm{ref}}; reward model rr; level α\alpha; threshold p†p^\dagger (default 12\frac{1}{2}); clip c∈(0,1)c\in(0,1); prior strength mm; budget Nmax⁡N_{\max}; weights πj=1j(j+1)\pi_j=\frac{1}{j(j+1)}

  1. A←∅A\leftarrow\varnothing; J←0J\leftarrow0 ▷ active answers; count of distinct answers seen

  2. for n=1,2,…,Nmax⁡n=1,2,\ldots,N_{\max} do

  3. for each a∈Aa\in A do ▷ bets are predictable: computed before yny_n is drawn

  4. θ^(a)←Z(a)+mSn−1(x,a)(n−1−σa)+m\hat{\theta}^{(a)}\leftarrow\frac{Z^{(a)}+mS_{n-1}(x,a)}{(n-1-\sigma_a)+m} ▷ RWSC mass S^\hat{S} from (1) on y1:n−1y_{1:n-1}

  5. λ(a)←clip⁡(θ^(a)−p†p†(1−p†),0,cp†)\lambda^{(a)}\leftarrow\operatorname{clip}\left(\frac{\hat{\theta}^{(a)}-p^\dagger}{p^\dagger(1-p^\dagger)},0,\frac{c}{p^\dagger}\right) ▷ plug-in Kelly bet, (10)

  6. end for

  7. sample yn∼πref(⋅∣x)y_n\sim\pi_{\mathrm{ref}}(\cdot\mid x); score r(x,yn)r(x,y_n); An←Ans⁡(yn)A_n\leftarrow\operatorname{Ans}(y_n)

  8. recompute RWSC masses Sn(x,⋅)S_n(x,\cdot) over y1:ny_{1:n}

  9. for each a∈Aa\in A do ▷ settle all active bets against the new observation

  10. X←1{An=a}X\leftarrow\mathbf{1}\{A_n=a\}; E(a)←E(a)⋅(1+λ(a)(X−p†))E^{(a)}\leftarrow E^{(a)}\cdot(1+\lambda^{(a)}(X-p^\dagger)); Z(a)←Z(a)+XZ^{(a)}\leftarrow Z^{(a)}+X

  11. end for

  12. if An∉AA_n\notin A then ▷ lazy instantiation; first observation consumed, not bet on

  13. A←A∪{An}A\leftarrow A\cup\{A_n\}; J←J+1J\leftarrow J+1; J(An)←JJ(A_n)\leftarrow J

  14. σAn←n\sigma_{A_n}\leftarrow n; E(An)←1E^{(A_n)}\leftarrow1; Z(An)←0Z^{(A_n)}\leftarrow0

  15. end if

  16. if ∃a∈A:πJ(a)E(a)≥1/α\exists a\in A:\pi_{J(a)}E^{(a)}\ge1/\alpha then ▷ Ville boundary, (8)

  17. a∗←arg⁡max⁡a∈AπJ(a)E(a)a^*\leftarrow\arg\max_{a\in A}\pi_{J(a)}E^{(a)}

  18. return y∗←arg⁡max⁡y∈Ya∗r(x,y)y^*\leftarrow\arg\max_{y\in\mathcal{Y}_{a^*}}r(x,y) ▷ certified: θa∗>p†\theta_{a^*}>p^\dagger w.p. ≥1−α\ge1-\alpha (Thm. 1)

  19. end if

  20. end for

  21. return yRWSC∗y^*_{\mathrm{RWSC}} from equation 2 ▷ budget exhausted: uncertified fallback

Deferred Proofs

Proof of Theorem 1. Let N={a:θa≤p†}\mathcal{N} = \{a : \theta_a \le p^{\dagger}\} denote the set of null answers, and for each answer aa let

Ca={∃n≥σa:πJ(a)En(a)≥1/α}(11)C_a = \{\exists n \ge\sigma_a : \pi_{J(a)}E_n^{(a)} \ge1/\alpha\} \tag*{(11)}

be the event that aa is certified at some time. Note that Ca⊆{σa<∞}C_a \subseteq\{\sigma_a < \infty\}, since E(a)E^{(a)} is instantiated only once aa has been observed. We must bound P(⋃a∈NCa)\mathbb{P}(\bigcup_{a\in\mathcal{N}} C_a).

Fix a∈Na \in\mathcal{N} and work on the event {σa<∞}\{\sigma_a < \infty\}, since outside this event there is no supermartingale—the process was never started, and J(a)J(a) isn’t even defined. The candidates are i.i.d. draws from πref(⋅∣x)\pi_{\mathrm{ref}}(\cdot\mid x) and σa\sigma_a is a stopping time, so conditionally on Fσa\mathcal{F}_{\sigma_a} the post-σa\sigma_a observations (Xi(a))i>σa(X_i^{(a)})_{i>\sigma_a} are i.i.d. Bernoulli(θa)(\theta_a) and independent of Fσa\mathcal{F}_{\sigma_a}; starting the product at σa+1\sigma_a+1 is what excludes the deterministic success Xσa(a)=1X_{\sigma_a}^{(a)} = 1 implied by the definition of σa\sigma_a. Each factor Ui=1+λi(a)(Xi(a)−p†)U_i = 1+\lambda_i^{(a)}(X_i^{(a)}-p^{\dagger}) is bounded below by 1−c>01-c>0, since worst case Xi(a)=0X_i^{(a)}=0 gives 1−λi(a)p†1-\lambda_i^{(a)}p^{\dagger} and λi(a)≤c/p†\lambda_i^{(a)} \le c/p^{\dagger}, and the bets are Fi−1\mathcal{F}_{i-1}-measurable, so

E[Ui∣Fi−1]=1+λi(a)(θa−p†)≤1,(12)\mathbb{E}[U_i \mid\mathcal{F}_{i-1}] = 1+\lambda_i^{(a)}(\theta_a-p^{\dagger}) \le1, \tag*{(12)}

using λi(a)≥0\lambda_i^{(a)} \ge0 and θa≤p†\theta_a \le p^{\dagger}. Hence, under the conditional law given Fσa\mathcal{F}_{\sigma_a}, the process n↦(En(a))n≥σan \mapsto(E_n^{(a)})_{n\ge\sigma_a} is a nonnegative supermartingale started at 1.

Ville’s inequality bounds P(sup⁡nMn≥u)≤1/u\mathbb{P}(\sup_n M_n \ge u) \le1/u for any nonnegative supermartingale with M0=1M_0=1. The rank J(a)J(a) is determined by the answers observed up to and including time σa\sigma_a, hence is Fσa\mathcal{F}_{\sigma_a}-measurable; applying Ville at threshold u=1/(πJ(a)α)u=1/(\pi_{J(a)}\alpha) gives

P(Ca∣Fσa)=P(sup⁡n≥σaEn(a)≥1πJ(a)α∣Fσa)≤πJ(a)αon {σa<∞}.(13)\mathbb{P}\left(C_a \mid\mathcal{F}_{\sigma_a}\right) = \mathbb{P}\left(\left.\sup_{n\ge\sigma_a} E_n^{(a)} \ge\frac{1}{\pi_{J(a)}\alpha}\right| \mathcal{F}_{\sigma_a}\right) \le\pi_{J(a)}\alpha\quad\text{on } \{\sigma_a<\infty\}. \tag*{(13)}

Since Ca⊆{σa<∞}C_a \subseteq\{\sigma_a<\infty\} and {σa<∞}∈Fσa\{\sigma_a<\infty\}\in\mathcal{F}_{\sigma_a}, the tower property gives

P(Ca)=E[E[1Ca∣Fσa]]=E[E[1Ca1{σa<∞}∣Fσa]]=E[P(Ca∣Fσa)1{σa<∞}]≤αE[πJ(a)1{σa<∞}].(14)\begin{aligned} \mathbb{P}(C_a) = \mathbb{E}\left[\mathbb{E}\left[\mathbf{1}_{C_a}\mid\mathcal{F}_{\sigma_a}\right]\right] = \mathbb{E}\left[\mathbb{E}\left[\mathbf{1}_{C_a}\mathbf{1}_{\{\sigma_a<\infty\}}\mid\mathcal{F}_{\sigma_a}\right]\right] = \mathbb{E}\left[\mathbb{P}(C_a\mid\mathcal{F}_{\sigma_a})\mathbf{1}_{\{\sigma_a<\infty\}}\right] \\ &\le\alpha\mathbb{E}\left[\pi_{J(a)}\mathbf{1}_{\{\sigma_a<\infty\}}\right]. \tag*{(14)} \end{aligned}

The set of possible answer strings is countable, so countable subadditivity applies. Combining with equation (14) and exchanging sum and expectation by Tonelli’s theorem (all terms nonnegative),

P(⋃a∈NCa)≤∑a∈NP(Ca)≤αE[∑a∈N, σa<∞πJ(a)]≤αE[∑a: σa<∞πJ(a)],(15)\mathbb{P}\left(\bigcup_{a\in\mathcal{N}} C_a\right) \le\sum_{a\in\mathcal{N}}\mathbb{P}(C_a) \le\alpha\mathbb{E}\left[\sum_{a\in\mathcal{N},\,\sigma_a<\infty}\pi_{J(a)}\right] \le\alpha\mathbb{E}\left[\sum_{a:\,\sigma_a<\infty}\pi_{J(a)}\right], \tag*{(15)}

the last inequality by dropping the restriction to N\mathcal{N}, which only adds nonnegative terms.

Fix a sample path. Answers are enumerated in order of first appearance, so a↦J(a)a\mapsto J(a) is injective on the observed answers {a:σa<∞}\{a:\sigma_a<\infty\}; the ranks are therefore distinct positive integers and

∑a: σa<∞πJ(a)≤∑j≥1πj=∑j≥1(1j−1j+1)=1.(16)\sum_{a:\,\sigma_a<\infty}\pi_{J(a)} \le\sum_{j\ge1}\pi_j = \sum_{j\ge1}\left(\frac{1}{j}-\frac{1}{j+1}\right)=1. \tag*{(16)}

This holds for every sample path, not merely in expectation, so the random variable inside the expectation in equation (15) is bounded above by the constant 11; hence its expectation is at most 11.

Substituting equation (16) into equation (15) gives P(⋃a∈NCa)≤α\mathbb{P}(\bigcup_{a\in\mathcal{N}} C_a)\le\alpha. Truncation at Nmax⁡N_{\max} only removes elements from each CaC_a, so the bound holds for any budget; and since Ville’s inequality controls the supremum over all times, the guarantee is unaffected by when the analyst chooses to stop, which is the anytime-validity property. □

Proof of Lemma 1. Observe that Gθ(λ)=E[log⁡(1+λ(X−p†))]=θlog⁡(1+λ(1−p†))+(1−θ)log⁡(1−λp†)G_\theta(\lambda)=\mathbb{E}[\log(1+\lambda(X-p^{\dagger}))]=\theta\log(1+\lambda(1-p^{\dagger}))+(1-\theta)\log(1-\lambda p^{\dagger}). Strict concavity is immediate since Gθ′′(λ)<0G_\theta''(\lambda)<0 on the admissible interval (a sum of two negative terms). Setting Gθ′(λ)=0G_\theta'(\lambda)=0 gives θ(1−p†)/(1+λ(1−p†))=(1−θ)p†/(1−λp†)\theta(1-p^{\dagger})/(1+\lambda(1-p^{\dagger}))=(1-\theta)p^{\dagger}/(1-\lambda p^{\dagger}); cross-multiplying and cancelling the terms linear in λ\lambda yields θ(1−p†)−λp†(1−p†)=(1−θ)p†\theta(1-p^{\dagger})-\lambda p^{\dagger}(1-p^{\dagger})=(1-\theta)p^{\dagger}, which gives the bet. Substituting λ∗(θ)\lambda^*(\theta) into GθG_\theta and simplifying, using 1+λ∗(1−p†)=θ/p†1+\lambda^*(1-p^{\dagger})=\theta/p^{\dagger} and 1−λ∗p†=(1−θ)/(1−p†)1-\lambda^*p^{\dagger}=(1-\theta)/(1-p^{\dagger}), gives the growth rate. □

Proof of Proposition 1. Write θ=θa⋆\theta=\theta_{a^\star}. Throughout, “→\to” denotes almost-sure convergence unless stated otherwise, and all statements are made on the event {σa⋆<∞}\{\sigma_{a^\star}<\infty\}, which has probability one since θ>0\theta>0. Recall the expected one-step log-increment

Gθ(λ)=EX∼Ber⁡(θ)[log⁡(1+λ(X−p†))]=θlog⁡(1+λ(1−p†))+(1−θ)log⁡(1−λp†).G_\theta(\lambda)=\mathbb{E}_{X\sim\operatorname{Ber}(\theta)}[\log(1+\lambda(X-p^\dagger))]=\theta\log(1+\lambda(1-p^\dagger))+(1-\theta)\log(1-\lambda p^\dagger).

Abbreviate λi=λi(a⋆)\lambda_i=\lambda_i^{(a^\star)}, Xi=Xi(a⋆)X_i=X_i^{(a^\star)}, ξi=log⁡(1+λi(Xi−p†))\xi_i=\log(1+\lambda_i(X_i-p^\dagger)), so that log⁡En(a⋆)=∑i=σa⋆+1nξi\log E_n^{(a^\star)}=\sum_{i=\sigma_{a^\star}+1}^{n}\xi_i.

(i) The plug-in bets converge. Conditionally on Fσa⋆\mathcal{F}_{\sigma_{a^\star}}, the post-instantiation indicators (Xi)i>σa⋆(X_i)_{i>\sigma_{a^\star}} are i.i.d. Bernoulli(θ)(\theta) (as in the proof of Theorem 1). By the strong law of large numbers, the empirical agreement rate Zi−1(a⋆)i−1−σa⋆→θ\frac{Z_{i-1}^{(a^\star)}}{i-1-\sigma_{a^\star}}\to\theta. The plug-in estimate (equation 10) is θ^i−1(a⋆)=Zi−1(a⋆)+mSi−1(x,a⋆)(i−1−σa⋆)+m\hat{\theta}_{i-1}^{(a^\star)}=\frac{Z_{i-1}^{(a^\star)}+mS_{i-1}(x,a^\star)}{(i-1-\sigma_{a^\star})+m}, a convex combination of the empirical rate and the bounded prior (RWSC mass) Si−1(x,a⋆)∈[0,1]S_{i-1}(x,a^\star)\in[0,1]. The prior weight m(i−1−σa⋆)+m→0\frac{m}{(i-1-\sigma_{a^\star})+m}\to0. Hence θ^i−1(a⋆)→θ\hat{\theta}_{i-1}^{(a^\star)}\to\theta regardless of the prior sequence. The Kelly map θ′↦clip⁡(λ⋆(θ′),0,c/p†)\theta'\mapsto\operatorname{clip}(\lambda^\star(\theta'),0,c/p^\dagger) is continuous (a clip of the continuous map λ⋆\lambda^\star), so by the continuous mapping theorem, the plug-in bet λi→λ⋆(θ)\lambda_i\to\lambda^\star(\theta) when λ⋆(θ)≤c/p†\lambda^\star(\theta)\le c/p^\dagger.

(ii) Convergence of capital. The bet λi\lambda_i is Fi−1\mathcal{F}_{i-1}-measurable by construction, and XiX_i is independent of Fi−1\mathcal{F}_{i-1} with mean θ\theta, so E[ξi∣Fi−1]=Gθ(λi)\mathbb{E}[\xi_i\mid\mathcal{F}_{i-1}]=G_\theta(\lambda_i). The map GθG_\theta is continuous on the compact interval [0,c/p†][0,c/p^\dagger] (a sum of logarithms with arguments bounded below by 1−c>01-c>0), so by continuity and Step (i), Gθ(λi)→Gθ(λ⋆(θ))G_\theta(\lambda_i)\to G_\theta(\lambda^\star(\theta)). The Cesàro lemma ([10]) gives

1n∑i=σa⋆+1nE[ξi∣Fi−1]→Gθ(λ⋆(θ)).(17)\frac{1}{n}\sum_{i=\sigma_{a^\star}+1}^{n}\mathbb{E}[\xi_i\mid\mathcal{F}_{i-1}]\to G_\theta(\lambda^\star(\theta)). \tag*{(17)}

Let Di=ξi−E[ξi∣Fi−1]D_i=\xi_i-\mathbb{E}[\xi_i\mid\mathcal{F}_{i-1}], so that (Di)i(D_i)_i is a martingale-difference sequence with respect to (Fi)i(\mathcal{F}_i)_i. Because λi∈[0,c/p†]\lambda_i\in[0,c/p^\dagger], each ξi\xi_i lies in the bounded interval [log⁡(1−c),log⁡(1+c(1−p†)/p†)][\log(1-c),\log(1+c(1-p^\dagger)/p^\dagger)], so ∣Di∣≤L|D_i|\le L for a constant L<∞L<\infty; in particular ∑iVar⁡(Di)/i2≤∑iL2/i2<∞\sum_i\operatorname{Var}(D_i)/i^2\le\sum_iL^2/i^2<\infty. Then, the martingale strong law ([10]) yields 1n∑i≤nDi→0\frac{1}{n}\sum_{i\le n}D_i\to0. Adding this with equation 17, and noting the finitely many terms with index at most σa⋆\sigma_{a^\star} contribute o(n)o(n) and so do not affect the Cesàro limit, gives 1nlog⁡En(a⋆)→Gθ(λ⋆(θ))=dKL(θ∥p†)\frac{1}{n}\log E_n^{(a^\star)}\to G_\theta(\lambda^\star(\theta))=d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger) whenever λ⋆(θ)≤c/p†\lambda^\star(\theta)\le c/p^\dagger.

(iii) Certification time. Fix a sample path in the probability-one event {σa⋆<∞}\{\sigma_{a^\star}<\infty\}, on which 1nlog⁡En(a⋆)→dKL(θ∥p†)\frac{1}{n}\log E_n^{(a^\star)}\to d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger). Since θ>p†\theta>p^\dagger, we have dKL(θ∥p†)>0d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger)>0 and hence log⁡En(a⋆)→∞\log E_n^{(a^\star)}\to\infty. Write bα=log⁡(1/(πJ(a⋆)α))b_\alpha=\log(1/(\pi_{J(a^\star)}\alpha)) for the log-boundary of a⋆a^\star. Note J(a⋆)J(a^\star), hence πJ(a⋆)\pi_{J(a^\star)}, is fixed on this path and does not depend on α\alpha, and bα→∞b_\alpha\to\infty as α→0\alpha\to0. Hence Na⋆(α)=min⁡{n:log⁡En(a⋆)≥bα}N_{a^\star}(\alpha)=\min\{n:\log E_n^{(a^\star)}\ge b_\alpha\} is finite for every α\alpha since the walk diverges, and Na⋆(α)→∞N_{a^\star}(\alpha)\to\infty as α→0\alpha\to0. Now, by definition,

log⁡ENa⋆(α)−1(a⋆)<bα≤log⁡ENa⋆(α)(a⋆).(18)\log E_{N_{a^\star}(\alpha)-1}^{(a^\star)}<b_\alpha\le\log E_{N_{a^\star}(\alpha)}^{(a^\star)}. \tag*{(18)}

On the fixed path, the sequence m↦1mlog⁡Em(a⋆)m\mapsto\frac{1}{m}\log E_m^{(a^\star)} converges to dKL(θ∥p†)d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger), so along the divergent integer sequence m=Na⋆(α)m=N_{a^\star}(\alpha) (and likewise m=Na⋆(α)−1m=N_{a^\star}(\alpha)-1, using Na⋆(α)−1Na⋆(α)→1\frac{N_{a^\star}(\alpha)-1}{N_{a^\star}(\alpha)}\to1) both outer terms of equation 18, divided by Na⋆(α)N_{a^\star}(\alpha), tend to dKL(θ∥p†)d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger). Hence bα/Na⋆(α)→dKL(θ∥p†)b_\alpha/N_{a^\star}(\alpha)\to d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger), i.e. Na⋆(α)/bα→dKL(θ∥p†)−1N_{a^\star}(\alpha)/b_\alpha\to d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger)^{-1}. Since bα/log⁡(1/α)=1+log⁡(1/πJ(a⋆))/log⁡(1/α)→1b_\alpha/\log(1/\alpha)=1+\log(1/\pi_{J(a^\star)})/\log(1/\alpha)\to1, we may replace bαb_\alpha by log⁡(1/α)\log(1/\alpha), yielding Na⋆(α)/log⁡(1/α)→1/dKL(θ∥p†)N_{a^\star}(\alpha)/\log(1/\alpha)\to1/d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger) a.s.

(iv) Stopping time. NN of equation 8 halts at the first answer to cross its boundary, so N≤Na⋆(α)N\le N_{a^\star}(\alpha) always, with equality when no other answer is certified first. When p†≥12p^\dagger\ge\frac{1}{2}, a⋆a^\star is the unique answer with θa⋆>p†\theta_{a^\star}>p^\dagger, so any other certified answer is non-dominant. By Theorem 1, this occurs with probability at most α\alpha. Thus P(N≠Na⋆(α))≤α\mathbb{P}(N\ne N_{a^\star}(\alpha))\le\alpha. Fix ε>0\varepsilon>0. Since Na⋆(α)/log⁡(1/α)→1/dKL(θ∥p†)N_{a^\star}(\alpha)/\log(1/\alpha)\to1/d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger) almost surely, and hence in probability,

P(∣Na⋆(α)/log⁡(1/α)−1/dKL(θ∥p†)∣>ε)→0.\mathbb{P}\left(\left|N_{a^\star}(\alpha)/\log(1/\alpha)-1/d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger)\right|>\varepsilon\right)\to0.

Combined with P(N≠Na⋆(α))≤α→0\mathbb{P}(N\ne N_{a^\star}(\alpha))\le\alpha\to0, a union bound gives

P(∣N/log⁡(1/α)−1/dKL(θ∥p†)∣>ε)→0,\mathbb{P}\left(\left|N/\log(1/\alpha)-1/d_{\mathrm{KL}}(\theta\mathbin\Vert p^\dagger)\right|>\varepsilon\right)\to0,

which completes the proof.

Comparison with baselines

Table 4 reports the full breakdown underlying the summary in § 4. The Oracle@24 row upperbounds what any selection rule can achieve from this candidate pool, and the gap to it is largest on CruxEval (76.5% vs. our best 54.8%) and smallest on GSM8K (96.5% vs. 91.4%), reflecting that code-execution answers are harder to concentrate reward mass on than short numeric ones. The base policy πref\pi_{\mathrm{ref}} alone already reaches 81.1% on GSM8K without any selection, so the relative gains from BoN-style methods are naturally compressed there; on MATH500, MMLU, and CruxEval, where the base policy starts much lower (63.6%, 65.8%, 44.0%), selection contributes proportionally more of the final accuracy. Soft BoN (Verdun et al., [25]) underperforms Vanilla BoN on every benchmark, indicating that softening the arg-max selection with a temperature is not by itself sufficient to recover the consensus robustness that RWSC’s explicit answer-level aggregation provides. Among the baselines, BEACON (Wan et al., [28]) takes a very high budget, whereas for others, budget usage is highly Reward Model dependent or benchmark-dependent rather than a fixed property of the method: Pandora’s Box BoN (Kalayci et al., [14]) is highly dependent on the scale of output of reward modes, with very confident answers of ArmoRM, it stops at budget same as burn-in phase, although it changes as we change the reward model, as it can be seen in Table 2, ConSol’s budget ranges from 5.39 on MMLU to 11.99 on CruxEval, and CITE’s stays comparatively flat (21.60–23.31) across all four, consistent with its fixed-target certification not adapting its threshold to how concentrated a given benchmark’s answer distribution is. SPRT-RWSC and E-RWSC track prompt difficulty instead: both spend the most on CruxEval (17.17 and 20.40, respectively) and the least on GSM8K (11.48 and 14.81), mirroring the same base-policy-strength ordering that governs the oracle gap.

Computational Overhead

A common concern in sequential early-stopping mechanisms is whether the continuous algorithmic overhead of evaluating statistical bounds at each step negates the savings gained from generating fewer tokens. To rigorously quantify this trade-off, we conduct comprehensive wall-clock hardware benchmarks on the MATH500 dataset under Nmax⁡=512N_{\max}=512 using the Qwen2.5-3B-Instruct policy and ArmoRM-Llama3-8B-v0.1 reward model. All measurements are executed on dedicated hardware: an NVIDIA RTX 6000 Ada Generation GPU (48GB VRAM) for model inference and an AMD host processor for sequential decision logic.

Per-Candidate Latency Decomposition. Table 5 breaks down the exact execution latency per candidate response. On MATH500, the average candidate trajectory generated by Qwen2.5-3B contains 500.7 tokens. Autoregressive LLM decoding takes 14.15 ms per token, resulting in an average generation latency of 7,084.50 ms (≈7.08 s) per candidate. A batched forward pass of ArmoRM requires an additional 59.76 ms to evaluate the candidate’s scalar reward. Answer extraction via canonical regex parsing adds approximately 0.20 ms on CPU. Thus, generating and evaluating a single candidate takes 7,144.26 ms (≈7.14 s) of total GPU compute.

Pipeline ComponentHardware DeviceComplexityLatency / Candidate
LLM Candidate Generation (Qwen2.5-3B)GPU (RTX 6000 Ada)O(L⋅dmodel)O(L \cdot d_{\mathrm{model}})7,084.50 ms (≈7.08 s)
RM Scoring (ArmoRM-8B forward pass)GPU (RTX 6000 Ada)O(L⋅dmodel)O(L \cdot d_{\mathrm{model}})59.76 ms
Answer Extraction & NormalizationCPU (Host)O(1)O(1) regex≈ 0.20 ms
E-RWSC E-Process Update & Kelly BetCPU (Host)O(∣A∣)O(\lvert\mathcal{A}\rvert) scalar0.014 ms (13.96 μ\mus)
Total GPU Compute per CandidateGPU—7,144.26 ms (≈7.14 s)
Algorithmic Overhead RatioHost CPU / GPU—≈ 0.00020%

Table 5. Hardware Latency Breakdown per Candidate on MATH500 using Qwen2.5-3B-Instruct (avg 500.7 tokens/candidate) and ArmoRM-8B on an NVIDIA RTX 6000 Ada GPU and AMD host CPU.

In sharp contrast, the sequential stopping check of E-RWSC requires computing predictable Kelly bets across the set of distinct semantic answer clusters A\mathcal{A} and updating scalar e-processes. Because empirical answer clustering produces at most ∣A∣≤5\lvert\mathcal{A}\rvert\le5 distinct answers per prompt, this step consists of simple scalar arithmetic with time complexity O(∣A∣)O(\lvert\mathcal{A}\rvert), executing in just 13.96 μ\mus (0.014 ms) on CPU. The ratio of algorithmic decision overhead to raw GPU candidate compute is approximately 0.00020% (≈ 1 part in 500,000).

End-to-End Computational Profile Across Methods. Table 6 reports the full end-to-end computational expenditure across all baseline methods on MATH500 under Nmax⁡=512N_{\max} = 512. Key empirical takeaways include:

MethodAvg Steps Nˉ\bar{N}Generated Tokens (kk)GPU Compute Time (s / query)Algorithmic Check Latency (μ\mus / step)Algorithmic Overhead (ms / query)Overall Acc (%)Certified Acc (%)
Fixed-Budget Baselines
Vanilla BoN512.0256.33657.7 (≈61.0 min)—0.00069.8%—
Self-Consistency512.0256.33657.7 (≈61.0 min)—0.00077.4%—
Adaptive Sequential Baselines
AdaBoN380.4202.62717.9 (≈45.3 min)0.02 μ\mus0.00869.4%76.4%
BEACON416.5213.02755.5 (≈49.6 min)1.75 μ\mus0.72970.0%71.8%
Pandora’s Box4.02.028.6 (≈0.5 min)0.17 μ\mus0.00168.6%68.6%
ConSol12.39.188.1 (≈1.5 min)0.13 μ\mus0.00274.8%74.8%
CITE124.986.5892.2 (≈14.9 min)194.33 μ\mus24.26977.4%83.7%
Proposed Frameworks
SPRT-RWSC (Ours)21.813.6155.8 (≈2.6 min)5.83 μ\mus0.12776.8%76.8%
E-RWSC (Ours)196.1137.11400.8 (≈23.3 min)13.96 μ\mus2.73778.0%94.5%

Table 6. End-to-End Computational Profile and Algorithmic Overhead on MATH500 (Nmax⁡=512N_{\max} = 512) for Qwen2.5-3B-Instruct with ArmoRM-8B. GPU generation and RM scoring latency measured on an NVIDIA RTX 6000 Ada GPU; algorithmic stopping-check overhead measured on the host CPU. Algorithmic overhead is under 0.0002% of generation time for E-RWSC, while saving 61.7% of total GPU compute time relative to fixed-budget BoN.

  1. Massive GPU Savings without Latency Overhead: Fixed-budget methods (Vanilla BoN and Self-Consistency) consume 3,657.7 s (≈61.0 minutes) of dedicated GPU compute per query across the 512 candidates. By halting early on confident prompts (τˉ=196.1\bar{\tau} = 196.1), E-RWSC slashes average GPU compute to 1,400.8 s (≈23.3 minutes)—saving 2,256.9 seconds (37.6 minutes) of GPU runtime per query (61.7% relative compute reduction). Over an entire query, the cumulative CPU stopping overhead of E-RWSC is just 2.737 ms, which is virtually unmeasurable in wall-clock user experience.

  1. Efficiency Superiority over CITE: While CITE also performs certified sequential stopping, its stopping criterion requires inverting empirical-Bernstein confidence intervals over

dynamic subsets of candidates at every step. This inflates CITE’s per-step check latency to 194.33 μ\mus (14×14 \times slower than E-RWSC), accumulating 24.269 ms of CPU compute per query. Despite this higher computational cost, CITE achieves only 83.7% certified accuracy, whereas E-RWSC achieves 94.5% certified accuracy with negligible algorithmic overhead.

  1. Reward Hacking Regularization: Vanilla BoN suffers severe performance degradation at N=512N = 512, dropping to 69.8% accuracy despite consuming over an hour of GPU compute. E-RWSC reaches 78.0% overall accuracy (and 94.5% on certified queries) while spending less than half the GPU compute, proving that anytime-valid stopping simultaneously optimizes computational efficiency and mathematical accuracy.

References

  1. [1]Pranjal Aggarwal, Aman Madaaan, Yiming Yang, et al. Let’s sample step by step: Adaptive-consistency for efficient reasoning and coding with llms. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, pp. 12375–12396, 2023.arxiv.org/abs/2305.11860
  2. [2]Ahmad Beirami, Alekh Agarwal, Jonathan Berant, Alexander Nicholas D’Amour, Jacob Eisenstein, Chirag Nagpal, and Ananda Theertha Suresh. Theoretical guarantees on the best-of-n alignment policy. In Forty-second International Conference on Machine Learning, 2025. URL https://openreview.net/forum?id=u3U8qzfVF7w.arxiv.org/abs/2401.01879
  3. [3]L Breiman. Optimal gambling systems for favorable games. The Kelly Capital Growth Investment Criterion: Theory and Practice, 3:47, 2011.
  4. [4]Guoxin Chen, Minpeng Liao, Chengxi Li, and Kai Fan. Alphamath almost zero: process supervision without process. Advances in Neural Information Processing Systems, 37:27689–27724, 2024.arxiv.org/abs/2405.03553
  5. [5]Jiefeng Chen, Jie Ren, Xinyun Chen, Chengrun Yang, Ruoxi Sun, Jinsung Yoon, and Sercan O Arik. SETS: Leveraging self-verification and self-correction for improved test-time scaling. Transactions on Machine Learning Research, 2025. ISSN 2835-8856. URL https://openreview.net/forum?id=Wv9NMJoKww.arxiv.org/abs/2501.19306
  6. [6]Karl Cobbe, Vineet Kosaraju, Mohammad Bavarian, Mark Chen, Heewoo Jun, Lukasz Kaiser, Matthias Plappert, Jerry Tworek, Jacob Hilton, Reichiro Nakano, et al. Training verifiers to solve math word problems. arXiv preprint arXiv:2110.14168, 2021.arxiv.org/abs/2110.14168
  7. [7]Paula Cordero-Encinar and Andrew B Duncan. Certified self-consistency: Statistical guarantees and test-time training for reliable reasoning in llms. arXiv preprint arXiv:2510.17472, 2025.
  8. [8]Thomas Coste, Usman Anwar, Robert Kirk, and David Krueger. Reward model ensembles help mitigate overoptimization. In International Conference on Learning Representations, volume 2024, pp. 50905–50931, 2024.arxiv.org/abs/2310.02743
  9. [9]Hanze Dong, Wei Xiong, Bo Pang, Haoxiang Wang, Han Zhao, Yingbo Zhou, Nan Jiang, Doyen Sahoo, Caiming Xiong, and Tong Zhang. RLHF workflow: From reward modeling to online RLHF. Transactions on Machine Learning Research, 2024. ISSN 2835-8856. URL https://openreview.net/forum?id=a13aYUU9eU.arxiv.org/abs/2405.07863
  10. [10]Rick Durrett. Probability: theory and examples, volume 49. Cambridge university press, 2019.
  11. [11]Alex Gu, Baptiste Rozier, Hugh James Leather, Armando Solar-Lezama, Gabriel Synnaeve, and Sida Wang. CRUXEval: A benchmark for code reasoning, understanding and execution. In Proceedings of the 41st International Conference on Machine Learning, volume 235 of Proceedings of Machine Learning Research, pp. 16568–16621. PMLR, 21–27 Jul 2024.arxiv.org/abs/2401.03065
  12. [12]Dan Hendrycks, Collin Burns, Steven Basart, Andy Zou, Mantas Mazeika, Dawn Song, and Jacob Steinhardt. Measuring massive multitask language understanding. In International Conference on Learning Representations, 2021a. URL https://openreview.net/forum?id=d7KBjmI3GmQ.
  13. [13]Dan Hendrycks, Collin Burns, Saurav Kadavath, Akul Arora, Steven Basart, Eric Tang, Dawn Song, and Jacob Steinhardt. Measuring mathematical problem solving with the math dataset. In J. Vanschoren and S. Yeung (eds.), Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks, volume 1, 2021b. URL https://datasets-benchmarks-proceedings.neurips.cc/paper_files/paper/2021/file/be83ab3ecd0db773eb2dc1b0a17836a1-paper-round2.pdf.
  14. [14]Yusuf Kalayci, Vinod Raman, and Shaddin Dughmi. Optimal stopping vs best-of-n for inference time optimization. arXiv preprint arXiv:2510.01394, 2025.arxiv.org/abs/2510.01394
  15. [15]John L. Kelly. A new interpretation of information rate. the bell system technical journal, 35(4): 917–926, 1956.
  16. [16]Hyunseok Lee, Seunghyuk Oh, Jaehyung Kim, Jinwoo Shin, and Jihoon Tack. Revise: Learning to refine at test-time via intrinsic self-verification. In Proceedings of the 42nd International Conference on Machine Learning (ICML), volume 267, pp. 33616–33634, 2025a.arxiv.org/abs/2502.14565
  17. [17]Jaeyeon Lee, Guantong Qi, Matthew Brady Neeley, Zhandong Liu, and Hyun-Hwan Jeong. Consol: Sequential probability ratio testing to find consistent llm reasoning paths efficiently. arXiv preprint arXiv:2503.17587, 2025b.arxiv.org/abs/2503.17587
  18. [18]Chris Yuhao Liu, Liang Zeng, Jiacai Liu, Rui Yan, Jujie He, Chaojie Wang, Shuicheng Yan, Yang Liu, and Yahui Zhou. Skywork-reward: Bag of tricks for reward modeling in llms. arXiv preprint arXiv:2410.18451, 2024.arxiv.org/abs/2410.18451
  19. [19]Yuhao Liu, Liang Zeng, Yuzhen Xiao, Jujie He, Jiacai Liu, Chaojie Wang, Rui Yan, Wei Shen, Fuxiang Zhang, Jiacheng Xu, et al. Skywork-reward-v2: Scaling preference data curation via human-ai synergy. In International Conference on Learning Representations, volume 2026, pp. 133805–133838, 2026.arxiv.org/abs/2507.01352
  20. [20]Hirofumi Ota, Naoto Iwase, Yuki Ichihara, Junpei Komiyama, and Masaaki Imaizumi. Cite: Anytime-valid statistical inference in llm self-consistency. arXiv preprint arXiv:2605.05873, 2026.arxiv.org/abs/2605.05873
  21. [21]Jiahao Qiu, Yifu Lu, Yifan Zeng, Jiacheng Guo, Jiayi Geng, Chenhao Zhu, Xinzhe Juan, Ling Yang, Huazheng Wang, Kaixuan Huang, et al. Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling. In EMNLP (Findings), pp. 20894–20917, 2025.arxiv.org/abs/2410.16033
  22. [22]Vinod Raman, Hilal Asi, and Satyen Kale. Adabon: Adaptive best-of-n alignment, 2026. URL https://arxiv.org/abs/2505.12050.
  23. [23]Aaditya Ramdas, Peter Grünwald, Vladimir Vovk, and Glenn Shafer. Game-theoretic statistics and safe anytime-valid inference. Statistical Science, 38(4):576–601, 2023.arxiv.org/abs/2210.01948
  24. [24]Hanshi Sun, Momin Haider, Ruiqi Zhang, Huitao Yang, Jiahao Qiu, Ming Yin, Mengdi Wang, Peter Bartlett, and Andrea Zanette. Fast best-of-n decoding via speculative rejection. In The Thirty-eighth Annual Conference on Neural Information Processing Systems, 2024. URL https://openreview.net/forum?id=348hfcp rUs.arxiv.org/abs/2410.20290
  25. [25]Claudio Mayrink Verdun, Alex Oesterling, Himabindu Lakkaraju, and Flavio P Calmon. Soft best-of-n sampling for model alignment. In 2025 IEEE International Symposium on Information Theory (ISIT), pp. 1–6. IEEE, 2025.arxiv.org/abs/2505.03156
  26. [26]Jean Ville. Étude critique de la notion de collectif, volume 3. Gauthier-Villars Paris, 1939.
  27. [27]A. Wald. Sequential Tests of Statistical Hypotheses. The Annals of Mathematical Statistics, 16(2): 117 – 186, 1945. doi: 10.1214/aoms/1177731118.DOI
  28. [28]Guangya Wan, Zixin Stephen Xu, Sasa Zorc, Manel Baucells, Mengxuan Hu, Hao Wang, and Sheng Li. Beacon: Bayesian optimal stopping for efficient llm sampling. arXiv preprint arXiv:2510.15945, 2025.arxiv.org/abs/2510.15945
  29. [29]Haoxiang Wang, Wei Xiong, Tengyang Xie, Han Zhao, and Tong Zhang. Interpretable preferences via multi-objective reward modeling and mixture-of-experts. In Findings of the Association for Computational Linguistics: EMNLP 2024, pp. 10582–10592, 2024.arxiv.org/abs/2406.12845
  30. [30]Xuezhi Wang, Jason Wei, Dale Schuurmans, Quoc Le, Ed Chi, Sharan Narang, Aakanksha Chowdhery, and Denny Zhou. Self-consistency improves chain of thought reasoning in language models, 2022.arxiv.org/abs/2203.11171

Paper details

vlnc:W_quqp4amh
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents