- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The author expanded the existing method “transplant,” a substitution method that outputs trajectories at gate positions where the base and reasoning models disagree. With dose-adjusted control experiments, the author confirmed that transplant alters task accuracy in both directions for hard-level problems, and this phenomenon is consistent across Qwen variants. Also, the author revealed that forks (positions with top-2 choices that significantly change consequential accuracy) are disjoint from gate positions. When the output length differs between the base and reasoning models, transplant carries output length and commits, which are positions where a model writes its final answer. However, extending reasoning length simply by injecting “wait” does not work. Reasoning models also have the ability to recognize correct runs among sampled trajectories. The author finally provides an interpretation that a reasoning model acquires exploration.
Critical strengths
Considered random control experiments: The author conducts random control experiments with an effective amount of substitution by considering the ratio of off-support words.
Critical weaknesses
- Detailed experiments, but still unclear conclusions: The paper seems to fail to provide a clear answer to the research question “what those few tokens buy,” stated in Section 1. In the conclusion section, the author insists that carrying what the model does before termination is the role of transplanted tokens. However, this is not narrowed down enough because the part before termination accounts for most of the output tokens. Furthermore, the author proposes an interpretation that the author insists fits the experimental results. However, further studies to validate the interpretation are not conducted.
- Limited target for “fork”: The author identifies “forks” by the discrepancy between the consequences of the top-2 tokens. Rather, I suppose that forcing a reasoning model's word at only one (not a few) of the “gate” positions could change the consequences. In this regime, forks match gates by definition, but this could lead to a more detailed analysis.
- Injecting “wait” at the end of the output is a somewhat simple intervention: A model has already completed writing its final answer at the stop position. Injecting “wait” at other positions (e.g., after a period in a sentence at random places) could be considered.
Questions for authors
- What does “transplant” carry into base models beyond superficial characters?
- Why does running through the transparent code with no substitutions alter performance in Section 3?
3 comments
Thank you for your comment. I understand that the tested models were not only Qwen3 variants, and the performance difference seems to be random noise at inference time. I have read your comment and confirmed additional characteristics of transplanted tokens (e.g., few numbers and symbols). However, further experiments to reveal the points mentioned have not been conducted; the contributions of this work remain limited. I therefore keep the current rating.
Thank you for your comment and time, we will work on the highlighted points in future work.
Thank you for your time and for a careful and constructive review. Your summary is accurate. One small detail is that only the first pair is Qwen3. The second is Olmo-3, a different model family, and the third is SimpleRL-Zoo on Qwen2.5. Since the submission we also ran a fourth pair, Open-Reasoner-Zero on Qwen2.5-7B, trained with reinforcement learning only and with runs about twice as long as its base model's. The result is the same. On contested problems its tokens close .75 [.49, 1.02] of the gap and the base model's tokens remove .81 [.56, 1.09], against .05 [−.17, .24] for tokens at random positions.
Unclear conclusions. We agree in part. The paper shows more than "before the stop". With all substitutions except those at the stop, the transplant closes as much of the gap as the full transplant, and the token at the stop alone closes nothing. The base model with the reasoning model's tokens also writes its answer once, late in the run (83% of the way in), and keeps it. So the tokens change the work that comes before the answer is written. But you are right that this is still a wide region, and that the paper does not say which tokens in it matter or why. We also agree that the interpretation at the end is not tested. It is offered as a hypothesis, and we will mark it more clearly as one.
Forcing one disagreement position at a time. Thank you for this suggestion. We have not run it. Forcing the reasoning model's token at a single position where the two models disagree, and measuring how much the outcome changes, would show directly which positions matter. We think it is a good next step.
"Wait" only at the stop. This is a fair point. We chose the stop because that is where budget forcing is usually applied. But at the stop the base model has usually written its answer already (at about 99% of the run's length), so a "Wait" there may come too late. Our test does not rule out that a "Wait" earlier in the run would help. Adding it after random sentence ends, as you suggest, is a good test, and we have not run it.
What does the transplant carry beyond surface tokens? We cannot answer this fully yet. Here is what we know.
Why the run with no substitutions differs (Section 3). The difference is within sampling noise. With nothing substituted, the transplant code gives .725 on rare and .925 on contested problems, against .769 and .902 for the reasoning model alone. Compared problem by problem, the differences are −.044 [−.092, +.002] on rare, +.023 [−.010, +.056] on contested and −.010 [−.040, +.019] on both together. They have opposite signs and all intervals include zero. The two numbers also come from different runs (two samples per problem against eight, with different random seeds). We will make this clear in the text.