rasyosef / gemma-4-E2B-it-dflash2

Gemma-4-E2B-it-DFlash2

A DFlash2 draft model for speculative decoding with google/gemma-4-E2B-it as the verifier, trained with speculators . The drafter proposes 7 tokens at a time and the verifier checks them in one forward pass, so output is identical to running the verifier alone. This makes it a lossless speedup. Mean acceptance length is 3.09 tokens committed per verification step, up to 5.41 on math_reasoning. that gives a throughput speedup over the verifier alone of 3.57× on math_reasoning and 3.06× on HumanEval.

Training code: rasyosef/train-dspark-draft-models .

Trained on 100,000 samples.

Usage

vLLM loads the verifier automatically from the config, so don't pass it separately.

vllm serve rasyosef/gemma-4-E2B-it-dflash2 --port 8000 --gpu-memory-utilization 0.8

Then query the OpenAI-compatible endpoint at http://localhost:8000/v1 .

Details

Architecture. A Qwen3-style decoder with 5 draft layers, ~0.32B params, bfloat16. It has hidden size 1536, MLP size 6144, and 12 query heads over 4 KV heads (GQA, head dim 128). The first four layers use sliding-window attention (window 2048) and the last uses full attention. Block size is 8. The draft vocabulary is the verifier's full 262,144 tokens, with no reduction. Aux hidden states come from verifier layers 3/13/23/33.

Training. 4 epochs at lr 4e-4 (AdamW, cosine schedule with 4% warmup). The data is 100,000 filtered Open PerfectBlend prompts regenerated by the verifier itself, split 96/4 into train and validation. Prompts were prepared at 2048 tokens. Training sequence length was 8192, with up to 512 anchors per sample. Verifier hidden states were pulled on demand from a running vLLM server during training and deleted after use, rather than staged to disk up front.

Evaluation

evaluate.py throughput across the nine RedHatAI/speculator_benchmarks subsets. acceptance_length is mean tokens committed per verification step, including the bonus token. Its floor is 1.0 and its ceiling is 8.0 at block size 8.

Weighted across all subsets: 3.094 over 108,043 verification steps.

Acceptance is highest where the verifier's next token is most predictable, and math_reasoning is in a class of its own. It leads HumanEval by about 1.2 tokens and still accepts more than two-thirds of pos_2 drafts (69.8%). Its last position (pos_6, 41.2%) sits above HumanEval's pos_4 (34.2%). math_reasoning is the one subset that makes real use of the full block. HumanEval is clearly second at 4.20, well ahead of everything else.

Comparison with MTP and DSpark

Acceptance length on the same nine subsets for Gemma's MTP drafter ( google/gemma-4-E2B-it-assistant ) and the DSpark drafter. The three propose different numbers of tokens per step, so their ceilings differ (9.0 for MTP, 9.0 for DSpark, 8.0 for DFlash2). A longer draft also costs more per step, so acceptance length alone doesn't determine speed. See the throughput section below for that.

MTP has the highest acceptance length on 8 of 9 subsets and on average. DSpark leads only on math_reasoning, where its longer block pays off. DFlash2 is second on every subset, ahead of DSpark everywhere except math_reasoning. The mean here is unweighted across subsets, so it differs slightly from the weighted 3.094 above.

Throughput (tokens/s)

Output throughput (tokens/s) on a single A100 at max concurrency 1, across the same nine subsets. Baseline is gemma-4-E2B-it with no speculative decoding. Speedup is the mean throughput relative to baseline, and the fastest drafter in each row is bolded.

MTP has the highest average speedup at 2.08× (unweighted mean of per-subset speedups), followed by DFlash2 at 2.02× and DSpark at 1.90×. MTP is fastest on tool_call, translation, rag, and summarization. DFlash2 is fastest on HumanEval, at 3.06× versus 2.90× for MTP, even though MTP accepts more tokens per step there. DSpark is fastest on math_reasoning (3.74× versus 3.57× for DFlash2) and narrowly on question, writing, and qa. Against DSpark alone, DFlash2 is ahead on HumanEval, translation, rag, summarization, and tool_call, and tied on writing.

Limitations

Works only with gemma-4-E2B-it and is not usable as a standalone model. Acceptance falls off steeply past the first two positions on prose-like traffic, most of all on summarization, so the gains concentrate in math and code. On prose-heavy workloads the tail of the block rarely gets accepted. Real-world speedup depends on your traffic mix. Because verification is lossless, the verifier's own behavior and biases carry through unchanged.

License

Apache 2.0, matching the verifier's license. The speculators training code is Apache-2.0.