- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This is an analysis paper that studies whether generating several reasoning candidates from one shared sampled prefix solves more problems than sampling them independently from the start, at the same token budget. Sharing a prefix saves tokens, but the candidates inevitably inherit the prefix's early thinking direction. The authors show that the tradeoff comes down to two quantities: i) how much of the problem’s success variance is explained by the prefix (ρ) and ii) how much generation it saves (s). So, independent sampling is at least as good whenever ρ ≥ s, i.e., the savings are greater than the paid variance reduction. Experiments on GSM8K with several open-weight models find that early tokens reduce output variance faster than they consume budget. So, shared-prefix candidates consistently reach fewer solutions than independent sampling. The paper also shows that after a failure, restarting beats continuing the same prefix, and that greedy prefixes can raise single-sample accuracy while lowering overall coverage.
Critical strengths
- Figures are very visually pleasant and clean.
- The structure of the paper is easy to follow, as theorems, propositions, tables, and figures are visually well delimited.
- Clean criterion. The paper turns a vague trade-off into two measurable quantities (ρ and s) with a theorem. The same criterion also covers retries and bounds larger candidate sets.
- Rigorous methodology. The analysis plans were pre-registered, the estimators are unbiased, and intervals are bootstrapped with Holm correction.
- Consistent findings. The ordering holds across models, branch positions, and budget definitions. The secondary results (restart beats continue, greedy prefixes raise pass@1 but lower coverage) are useful for anyone designing tree search.
Critical weaknesses
-
Limited theoretical novelty. The core criterion is the classical optimum of two-stage cluster sampling, which the authors do acknowledge (Kish, Cochran). The contribution is the transfer and the measurement, not the maths.
-
Limited experimental breadth.
- The main experiments use short GSM8K solutions from base models with a 320-token budget. They don't test where shared generation reportedly helps, E.g., long reasoning on hard problems with branches at uncertain tokens.
- The theory covers entropy-based branching, but the paper never measures it, and the planned competition-problem runs only on 10 qualifying problems.
- Only 2-9B models are tested, and four of five are Qwen 3.5 variants.
-
The matched-policy premise is not fully explained. Shared continuations have lower pass@1 in all 17 settings, significant when pooled at 48 tokens, and the cause is unexplained. Yet all the theorems rely on that premise.
Questions for authors
- Theorem 2 mentions entropy-based branch positions, but all experiments branch at fixed positions. Does ρ/s fall below 1 when branching is triggered by entropy or confidence?
- Shared continuations have lower pass@1 than independent samples in all 17 settings. What causes this, given that the theory assumes the two have the same distribution?
9 comments
Response to Reviewer 4MoD (2/4)
The pass@1 of shared continuations (Q2, W3)
Q2. "Shared continuations have lower pass@1 than independent samples in all 17 settings. What causes this?" W3. "The matched-policy premise is not fully explained."
In each of the 17 settings, shared and independent pass@1 agree within error (largest gap 2.1 pp); pooled over the base models at 48 tokens, the 1.7 pp shortfall is significant. Sharing cannot cause it, since a continuation has the same distribution whether its prefix is continued once or eight times, and three bounds show it is far too small to produce the coverage gaps. Most of it, 1.2 pp, sits in the source paths, complete samples drawn before any continuation, which fall below the independent bank within error; continuations track their own source paths (+0.5, +0.4, −0.5 pp). Continuations resume from the exact token IDs with the sampler, settings and remaining allowance of independent sampling (Proposition 4).
| Shared minus independent pass@1 (pp) | 8 tokens | 16 tokens | 48 tokens |
|---|---|---|---|
| Continuations − their own source paths (four base models) | +0.5 | +0.4 | −0.5 |
| Source paths − independent bank (one value for all positions) | −1.2 [−3.2, 0.9] | −1.2 | −1.2 |
| Total, pooled | −0.7 [−1.7, 0.3] | −0.8 [−2.0, 0.4] | −1.7 [−3.3, −0.1] |
Four base models; every interval of the two parts contains zero. The 17 negative point estimates rest on five banks, because the positions of each model share one bank and one set of source paths.
Thinking models: in the 8K model the source paths fall 5.6 pp below the bank [−9.4, −1.8], and continuations lie 3.9–5.2 pp above their own source paths, each interval excluding zero, which brings them back to within 1.7 pp of the bank. The deficit is one of termination: 57.0% of source paths reach the 8K allowance against 51.5% of bank samples [+1.9, +9.3], while traces that conclude are correct in 100% and 99.9% of cases. The allowance therefore accounts for the whole deficit. The estimators use source-path outcomes only for prefixes that have already ended, so the deficit does not produce the coverage gaps (Appendix C). For Qwen3-8B with 32K tokens the differences are −0.7, +2.0 and +1.6 pp at 5, 20 and 40%, all within error.
In code the sign reverses, with the source draws. In MBPP (Appendix E.5) the source paths drew 1.7 pp above their independent bank, within error, and shared pass@1 is higher at all five positions (+0.2 to +1.7 pp). At 4 and 8 tokens this accounts for 1.2 and 1.4 pp of the 1.7 and 1.9 pp by which two shared candidates beat the Proposition 1 prediction; the curvature of pass@k and program lengths account for the rest. In the base models, the thinking model and MBPP alike, the sign of the difference is that of the source draws, which precede any continuation.
Three bounds attribute the coverage gap to sharing; weaker resumed candidates account for at most 1.8 pp of the eight-candidate gap at 48 tokens:
| Bound on the effect on coverage | Value |
|---|---|
| Four prefixes continued once each, against four independent samples (no sharing) | −0.6 pp on average (+0.5 to −2.3; 1 of 17 intervals excludes zero) |
| One prefix continued four times, against those same resumed candidates (sharing) | −4.1 to −25.6 pp |
| Attributing the whole shortfall to in the Beta model of eight shared candidates | at most 1.8 pp, against measured gaps of 14.9–25.0 pp at 48 tokens |
Section 2 and Appendix C now report this decomposition next to the three bounds.
Response to Reviewer 4MoD (3/4)
Novelty (W1)
W1. "The core criterion is the classical optimum of two-stage cluster sampling … The contribution is the transfer and the measurement, not the maths."
The two-candidate condition coincides with Kish's optimum, which Section 3 cites; three results go beyond it:
| Two-stage cluster sampling (Kish) | This paper | |
|---|---|---|
| Objective | variance of an estimated mean | coverage , a nonlinear functional of the whole distribution of ; Theorem 1 gives its exact loss for every N as an expected Bregman gap |
| Scope of the result | the optimal subsample size for a mean | Theorem 2: makes independent sampling at least as good as every preset allocation on that question, for every N (via log-convexity of ) |
| Adaptive and selected prefixes | not addressed by the two-stage optimum | the identity stays exact at stopping times (the confidence trigger); Corollary 1 splits a selected prefix into sharing cost and gain from the choice; Proposition 3 gives the continue-or-restart rule |
This is how Section 7 reads the branch rules: forking tokens add no measurable inherited success, and Fork-Think's greedy seed leaves 24 of 128 questions without a successful continuation, where independent sampling with the same tokens is expected to solve 22.6 of them. The long-reasoning run follows Proposition 3's ordering (after four failures, restart 21.8% against continue 10.6%).
The criterion also predicts the size of the coverage gain where sharing pays, which a variance optimum for a mean does not give. In a positive control, when worked examples make the first tokens restate the question, at 48 tokens falls from 0.48 to 0.02 against of 0.23, and two shared candidates go from 4.5 pp behind independent ones to 3.8 pp ahead; at the end of the restatement they lead by 5.1 [4.2, 6.2] pp, against 5.3 predicted (General Response 2/3).
Section 3 now states, right after the Kish citation, how Theorem 2 turns the variance condition into a coverage statement.
Response to Reviewer 4MoD (1/4)
Summary, and branch points chosen by entropy or confidence (Q1)
Thank you for a precise and technically deep review. Your questions on branch points chosen by entropy or confidence, on the pass@1 premise and on the breadth of models and tasks pointed exactly where further tests would add the most. We measured each of them: the results support the submission's criterion and extend it to settings the submission did not cover:
Not significantly. An entropy or confidence threshold is a stopping time, which Theorem 2 covers, and at our confidence trigger ρ(τ)/s(τ) is 1.22 [0.97, 1.49] on Qwen3.5-35B-A3B and 0.84 [0.51, 1.22] on Qwen3-8B with 32K tokens. Rules that take the highest-scoring tokens of a whole path, EPTree's −logπ (which TreeRL calls entropy) and Fork-Think's top-10 entropy, select the prefix; Corollary 1 prices them as the sharing term plus the gain from the choice, and in their main configurations none covers significantly more than independent sampling at an equal budget.
Positive favors independent sampling; bold: 95% interval excludes zero; †: not significant after Holm's adjustment (Appendix E.2). Tree by tree, independent coverage is 85–95%.