- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Shared-Prefix Self-Consistency (SP-SC). The method first generates one or more complete solutions and retains a prefix from each solution. It then generates new continuations from these prefixes. Finally, all candidate solutions are combined through majority voting, with original solutions and generated continuations receiving equal voting weight. The authors use Qwen3-14B to investigate the effects of prefix length, the number of independent reasoning trunks, and the number of candidate solutions on AIME 2025 and HMMT 2025. Under certain configurations, SP-SC achieves a better trade-off between accuracy and token consumption than standard Self-Consistency, Adaptive Self-Consistency, and Early-Stopping Self-Consistency. In addition, the authors conduct a separate experiment showing that even when a complete solution produces an incorrect final answer, its reasoning prefix may still lead to correct answers through alternative continuations.
Critical strengths
-
The method is simple and easy to implement. It can be directly applied to existing language models without additional training or a separate verification model.
-
The method demonstrates effectiveness and practical value. On AIME 2025, the proposed method with eight candidates achieves an accuracy of 81.72%, with an average generation cost of 98.7K tokens per problem. In comparison, standard Self-Consistency with eight independent complete solutions achieves 79.44% accuracy while consuming 130.6K tokens per problem. These results demonstrate that the proposed method can reduce token consumption while maintaining or slightly improving accuracy.
-
The paper includes comparative experiments and ablation studies. The authors compare SP-SC with several existing Self-Consistency methods and investigate the effects of important design choices, including prefix length and the number of reasoning trunks.
Critical weaknesses
-
The novelty of the proposed method is somewhat limited. Previous work, such as Path-Consistency, has already explored using reasoning prefixes to guide subsequent generations. The authors should further clarify what SP-SC contributes beyond these existing approaches and identify its main technical novelty.
-
The experimental results may depend heavily on a small number of selected reasoning trunks. In Sections 5.3–5.4, the baseline methods sample from a pool of 316 complete solutions per problem, while SP-SC uses only four designated reasoning trunks. The single-prefix setting further relies on one fixed trunk.The 500 trials are conducted by repeatedly resampling from a fixed pool of previously generated results, rather than generating new independent reasoning trunks.Therefore, the experiments do not sufficiently demonstrate whether the reported performance would remain stable with different sets of reasoning trunks. It is difficult to determine how much of the improvement comes from prefix reuse itself and how much comes from the quality of these selected trunks. It is possible that the chosen trunks happen to perform particularly well.
-
The prefix rescue experiment does not fully establish the benefit of prefix reuse. The experiment shows that incorrect solutions may contain useful reasoning prefixes. However, generating 20 continuations for each prefix already provides multiple additional opportunities to find the correct answer. Moreover, it remains unclear whether reusing these prefixes is more efficient than generating entirely new solutions from scratch.I suggest adding a baseline that generates independent complete solutions under the same token budget. This comparison would help determine how much improvement comes specifically from prefix reuse. Additionally, reporting the final majority-voting accuracy in the rescue experiment would help demonstrate whether the correct continuations actually improve the final prediction.
Questions for authors
-
The novelty of the proposed method is somewhat limited. Previous work, such as Path-Consistency, has already explored using reasoning prefixes to guide subsequent generations. The authors should further clarify what SP-SC contributes beyond these existing approaches and identify its main technical novelty.
-
The experimental results may depend heavily on a small number of selected reasoning trunks. In Sections 5.3–5.4, the baseline methods sample from a pool of 316 complete solutions per problem, while SP-SC uses only four designated reasoning trunks. The single-prefix setting further relies on one fixed trunk.The 500 trials are conducted by repeatedly resampling from a fixed pool of previously generated results, rather than generating new independent reasoning trunks.Therefore, the experiments do not sufficiently demonstrate whether the reported performance would remain stable with different sets of reasoning trunks. It is difficult to determine how much of the improvement comes from prefix reuse itself and how much comes from the quality of these selected trunks. It is possible that the chosen trunks happen to perform particularly well.
-
The prefix rescue experiment does not fully establish the benefit of prefix reuse. The experiment shows that incorrect solutions may contain useful reasoning prefixes. However, generating 20 continuations for each prefix already provides multiple additional opportunities to find the correct answer. Moreover, it remains unclear whether reusing these prefixes is more efficient than generating entirely new solutions from scratch.I suggest adding a baseline that generates independent complete solutions under the same token budget. This comparison would help determine how much improvement comes specifically from prefix reuse. Additionally, reporting the final majority-voting accuracy in the rescue experiment would help demonstrate whether the correct continuations actually improve the final prediction.
Clarifications and expanded experiments explained.
We thank the reviewer for the careful reading and concrete suggestions. We expanded the evaluation and clarify below the distinction from Path-Consistency, the role of trunk selection, and the comparison with independent sampling.
1. Novelty relative to Path-Consistency
Our novelty is the use of prefixes from unfiltered reasoning paths to obtain additional votes, supported by the observation that a trunk with an incorrect final answer can still provide a productive prefix. SP-SC therefore requires no confidence threshold or answer-based ranking to decide which trunks to reuse.
Path-Consistency selects prefixes from paths supporting the leading answer, with its thresholded version waiting until an agreement-based confidence criterion is met. SP-SC samples independent trunks, retains fixed fractions of them, and generates alternative continuations from multiple prefixes. Original trunks and continuations contribute equally to the final vote. This directly studies whether prefix reuse can improve the accuracy–token trade-off without first identifying the most promising paths.
Section 3 provides the motivating evidence. Prefixes from incorrect trunks can produce correct continuations, including groups with at least ten successes out of twenty. The new Gemma HMMT analysis gives another example, where a trunk answering "2/27" incorrectly produces 12/12 correct continuations having the answer "4/9" from its 20% (tau = 0.2) prefix. These observations motivate exploiting alternative outcomes from a prefix even when its original completed solution fails.
2. Trunk variability and expanded evaluation
We agree that four designated trunks, particularly one fixed single-prefix trunk, limited the original evidence. We added Gemma 4 12B IT, from a different model family, on all 30 problems in both AIME 2025 and HMMT 2025. The updated setting generates 100 independent full responses per problem, selects eight without correctness-based filtering, and generates 12 continuations per trunk at each of four prefix fractions. Sections 5.3–5.4 describe the protocol, and Section 6 and the appendix report the results.
For each of 500 trials, the Gemma replay shuffles the eight trunks and selects S without replacement. Single-prefix and smaller multi-prefix settings therefore vary their starting trunks, while S=8 uses all eight. Continuations are also resampled. Averaging over all questions and these trials reduces dependence on any one selected path, although the trials still quantify variability within saved pools. Favorable operating points occur in both Qwen benchmarks and Gemma AIME, covering three of the four model–dataset pairs.
We also report Gemma HMMT’s weaker result and examine problems 20, 29, and 30 in Section 6. Problems 20 and 29 have no correct selected trunk and five missing-answer trunks each. Problem 30 has one correct trunk, three missing-answer trunks, and two matching wrong votes. As a diagnostic, excluding these same three problems for both methods gives SP-SC (.2,8,32) 99.80% accuracy at 812.8K tokens per problem, versus SC N=32 at 98.89% and 846.0K. This illustrates the concentration of failures. The main benchmark results retain all 30 problems.
3. Comparison with independent generation
The blue SC points in Section 6 implement the requested independent-generation baseline. Every SC candidate is a complete solution generated independently from the question. SP-SC instead spends its budget on complete trunks and their continuations. Both methods charge all consumed generation, including incorrect and missing-answer outputs.
A vertical comparison through the graph evaluates their final-vote accuracies at the same mean generated-token budget on the horizontal axis. Since the evaluated SC budgets are discrete, we compare against SC settings at equal or lower mean cost. This shows whether spending tokens on reused prefixes is beneficial compared with spending those tokens on independent complete solutions. Selected SP-SC settings improve this trade-off in three of the four model–dataset pairs, with accuracy and cost averaged over all problems and 500 trials.
The rescue experiment shows that prefixes from incorrect trunks can still produce correct continuations, including groups with at least ten successes out of twenty. The main experiments provide the comparison against independent generation at measured token costs. Rescue supplied the initial motivation for SP-SC by showing why reuse can be useful even without identifying and grouping high-confidence paths beforehand. Its recoverability metrics and the main experiments’ final-vote accuracy answer complementary questions.