Skip to content
← Back to research index

abstract indexed · arXiv 2609.16648 · updated 2026-10-18

GrowMTP: Can RL Grow Its Own Draft Head?

First page of GrowMTP: Can RL Grow Its Own Draft Head?
From the original paper · arXiv 2609.16648Page 1. Select the image to read the PDF.

GrowMTP replaces the separate pretraining or warm-up phase required to obtain a speculative-decoding draft head by training that head from scratch inside the RL loop, using rollout verification signals as supervision with gradients detached from the policy backbone. The cost is additional training compute and integration complexity within the RL framework, plus acceptance-rate variance while the head converges early in the run. It can fail to deliver end-to-end gains if rollouts are not the wall-clock bottleneck, if the workload's rollout distribution is too broad for the head to learn useful drafts, or when the model already ships with a strong draft head, where the reported gain shrinks to 1.20x.

For solo builders

A possible application for this research area. Paper-specific feasibility still needs a full-paper review.

Your self-hosted model spends too long generating answers token by token.

What you would change

Check whether a compatible draft model and serving integration exist before renting compute.

Try the idea on your product

A proposed first test. Set your budget and success criteria before running it.

Check whether a compatible draft model and serving integration exist before renting compute.

Compare against

The same target with speculation off, then your existing drafter if you have one.

  1. Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.
  2. Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.
  3. Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
  4. Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test.

What to measure

Accepted draft length, tokens per second, tail latency, output quality, and total GPU cost.

When to keep it

Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation.

Download test plan ↓

abstract indexedPaperraft next step

Do not allocate compute yet.

This page uses the abstract and public adoption signal only. Request the deep report before relying on its recommendation.

Abstract-level screening only. Risks and infrastructure may not have been evaluated. This recommendation is not a reproduced result.
minimum test setup
not reported
published evidence setup
not reported
source-linked claims
0 of 2
exposure checks
0 of 8

Why it was shortlisted

The technical change, research area, and reason it entered the archive.

recommendation
test
research area
speculative decoding
technical change
Online draft-head training inside RL loop
published
2026-09-15

The method is only relevant if the reader runs RL post-training on small open models, which is feasible on a single 24 GB GPU for 4B-class models, so the claimed speedup warrants a workload-specific trial rather than blind adoption or dismissal.

Central equations

Original equations, typeset for reading. Paperraft explanations connect the mechanism, its aim, and the evidence.

where TV is the total variation distance. Acceptance is chain-dependent: the l-th token contributes only when positions 1 through l are all accepted. Chaining these local rates yields a differentiable surrogate for the accepted length, whose negation is the TV loss (Zhou et al., 2024; Li et al., 2026a)

ℒTV=−∑l=1K∏i=1lαi.

equation (6) · §3 GrowMTP: Growing Draft Heads within RL · baseline

To give cycles with smaller chain values greater relative gradient weight, we apply a logarithmic transformation to the acceptance-chain surrogate to obtain the DCA training objective (Appendix I):

ℒDCA=−log(−ℒTV)=−log∑l=1Kexp(∑i=1llogαi),

equation (7) · §3 GrowMTP: Growing Draft Heads within RL · proposed method

This soft weighting does not enforce the realized rejection boundary: positions after the first rejection can still receive nonzero gradients. Since verification already marks the first-rejection position j of each cycle, with j=K+1 when every draft is accepted, we introduce verify-gated masking (VGM), which truncates the chain sum at and including the first rejected position of the recorded cycle,

ℒDCAVGM=−log∑l=1min⁡(j,K)∏i=1lαi,

equation (9) · §3 GrowMTP: Growing Draft Heads within RL · proposed method

equations from arXiv HTML · fetched 2026-10-15

Claims and evidence

A claim is source-linked only when the PDF page and matching excerpt are available.

  1. claim 01Paperraft inference
    Read the brief interpretation

    GrowMTP replaces the separate pretraining or warm-up phase required to obtain a speculative-decoding draft head by training that head from scratch inside the RL loop, using rollout verification signals as supervision with gradients detached from the policy backbone. The cost is additional training compute and integration complexity within the RL framework, plus acceptance-rate variance while the head converges early in the run. It can fail to deliver end-to-end gains if rollouts are not the wall-clock bottleneck, if the workload's rollout distribution is too broad for the head to learn useful drafts, or when the model already ships with a strong draft head, where the reported gain shrinks to 1.20x.

    This is a Paperraft inference. It is not pinned to a verified PDF passage.

    Inspect the source
  2. claim 02Paperraft inference

    Reported rollout speedups of 2.13x, 1.93x, and 1.36x and end-to-end RL speedups of 1.60x, 1.41x, and 1.20x on Qwen3-4B, MiMo-7B-SFT, and Qwen3.5-4B-Base respectively, with the largest gains for models lacking a pretrained draft head.

    This is a Paperraft inference. It is not pinned to a verified PDF passage.

    Inspect the source

Exposure map

Author findings, Paperraft interpretations, and the next check. Missing analysis never counts as evidence of safety.

quality

Still unknown

Which tasks improve, and which regress against the baseline?

compute and memory

Still unknown

What memory, hardware, and total compute does the complete method require?

latency

Still unknown

Are startup time, typical response time, and slow requests measured separately?

operations

Still unknown

What must be monitored, maintained, and rolled back?

software compatibility

Still unknown

Does the implementation support your model, runtime, and hardware?

security

Still unknown

What new data access, permissions, or trust boundaries does it introduce?

data and training

Still unknown

What data preparation or training is required, and is it included in the cost?

reproducibility

Still unknown

Are code, versions, inputs, and evaluation scripts available?

Continue the investigation

A reading guide for speculative decoding.

Editorial prompts, not findings from this paper or a validated test plan. Detailed analysis is still pending for the topics below.

What to inspect

How are proposals verified, and what happens after rejection? Check the assumptions behind any quality guarantee.

Plan a fair comparison

Can you compare the same target model with speculation off and on, including proposal and verification time?

Questions for adoption

Which draft model or prediction heads are needed, and how does acceptance change with the workload?

Read the paper with these questions

Inside the paper

Preview the first 3 pages of the original PDF. Click the stack to turn the page.

The downloadable skill includes SKILL.md and evidence.json, with recorded findings and unanswered checks. TRY-IT.md adds a product test plan and a blank results sheet.

A reading aid for your agent. Findings still need validation.

Page 1 of 3
Open this page in the PDF ↗

Provisional research brief updated 2026-10-18. Paperraft has not reproduced this experiment.

Discuss this paper

Question a claim, compare interpretations, or share what happened when you tried the method.

Join the conversation on GitHub. Use this paper's arXiv ID in the title when starting a discussion.

arXiv 2609.16648

Comments are public and separate from Paperraft's research brief. When sharing a result, include the model, hardware, baseline and a link to your work.