- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
GrowMTP learns a speculative-decoding draft head during RL, using the target distributions and draft trajectories produced by rollout verification. The method reconstructs each draft cycle, applies a logarithmic transformation to an acceptance-chain objective, and retains supervision through the first rejected position. The head loss is detached from the policy backbone. On Qwen3-4B, a randomly initialized recurrent head learns quickly enough to accelerate the same 500-step RL run by 1.60× on math and 1.56× on code, including the cost of training the head. Experiments on two models with pretrained heads examine online adaptation, drafting depth, and the individual components. Held-out evaluations assess both acceptance length and policy quality.
Critical strengths
-
The from-scratch result is convincing and practically useful. On Qwen3-4B, acceptance length grows from 1.00 to 2.91 on math and 2.64 on code. Appendix B.4 makes clear that timings cover the entire run, including the initial learning period and head updates, whereas these acceptance figures describe the final ten steps. Thus, the reported savings account for the cost of acquiring the drafting capability. The held-out results show no evident loss of policy quality in either domain. This is a useful option for RL runs on models without a pretrained draft head.
-
The paper treats the training and serving details carefully. Reconstruction preserves the cycle boundaries and the distinction between backbone-derived prefix features and the head's recurrent draft features; Appendix G explains why simply unrolling the head over the committed response does not reproduce that computation. The experiments also track the quantities that matter in practice: joint CE can increase acceptance while destroying policy quality, and increasing MiMo's depth from five to seven improves acceptance while slowing the full step. The top-64 approximation check and the clear separation between the acceptance surrogate and actual rollout acceptance make the method easier to assess.
Critical weaknesses
-
The ablations leave the main methodological question partly open. Detached CE is compared on Qwen3.5, and the more detailed reconstruction, objective, and masking ablations use MiMo; both begin with pretrained heads. Qwen3-4B is evaluated only with the complete method. I would like to know whether its successful start from random initialization depends on DCA and masking, or whether detached CE or the TV-chain objective would learn a similarly useful head. This distinction matters because online drafter adaptation is already present in ReSpec, and Bebop introduces the multi-step TV objective, as the paper acknowledges. The complete system works, but the evidence for what enables its central result is less conclusive.
-
The finer efficiency comparisons need more careful attribution. DCA reduces step time from 382.69 seconds with TV to 371.02 seconds in Table 10, about 3%, without uncertainty across independent runs or generated-token counts. These omissions matter more for this close comparison than for the large gain over autoregressive decoding. In Table 5, reconstruction reaches nearly the same aggregate acceptance as teacher forcing while supervising fewer positions, so the result establishes a useful cost saving but provides weaker evidence that correcting the state mismatch is responsible for the gain. Separately, Table 4 compares a frozen MiMo head at K=1 with trained heads at larger K, combining the effects of online training and draft depth. None of these issues invalidates the main result, but they limit the conclusions about which ingredients account for the savings.
Questions for authors
- Main comparison: Can you compare the randomly initialized Qwen3-4B head under detached CE or TV with the complete method, keeping reconstruction and the other settings fixed? Acceptance during the initial learning phase and cumulative GPU-hours would directly address the first weakness.
- Attribution of speedups: What acceptance and step time does the frozen MiMo head achieve at K=5? For the close DCA–TV comparison, can you provide generated-token counts and any available evidence of run-to-run variability?
- Cost clarification: How was the 161.6 GPU-hour offline budget in Table 2 selected? Also, at which step does GrowMTP first use less cumulative compute than autoregressive RL? Figures 5–6 identify when individual steps become faster, which is a different point.