GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
RecentarXiv preprint

DiffusionGemma Technical Report

DiffusionGemma refines token blocks in parallel. Learn why fast decoding can coexist with lower task quality, delayed stable output and a different serving bottleneck.

Breakdown by FDE Interviews · 9 min read · Updated

About the original · 2026
AUTHORS
DiffusionGemma Team, Taïga, Assiene, Calandriello, et al.
FROM
Google DeepMind
PUBLISHED
Jul 2026 · arXiv preprint
IN THIS BREAKDOWN · 10 SECTIONS

You can read 17% of this breakdown.

01

The paper in one minute

DiffusionGemma generates text by repeatedly refining a block of token predictions. An ordinary autoregressive model commits one token before predicting the next. Here, positions inside a block can influence one another during denoising, allowing many output tokens to be resolved with fewer model calls.

The starting point is Gemma 4's mixture-of-experts model. Supervised adaptation teaches block denoising; subsequent sampler distillation and reinforcement learning improve quality while reducing the required refinement steps. The result retains autoregressive generation as another operating mode, but the diffusion mode represents a changed model distribution, not an exact acceleration of the original model.

The report's speed measurements are impressive under their stated conditions. The quality tables also show clear losses relative to the autoregressive initialization. Both observations matter. A fast response that misses a required action is not an equivalent replacement for a slower successful response.

This July 2026 paper is particularly useful for understanding why serving systems should report decoding throughput, complete-request latency and task success separately. Its maximum denoising budget, adaptive stopping behavior and workload-dependent output lengths make a single tokens-per-second number an incomplete deployment specification.

THE IDEA, VISUALLY
FAST OUTPUT DOES NOT REMOVE THE WAIT BEFORE OUTPUT Synthetic request: 256 output tokens, 300 ms queue, 200 ms prefill. Timeline units are illustrative. Autoregressive Block diffusion Queue Prefill Queue Prefill Reveal tokens incrementally Denoise block Release stable output In this example, first AR token: 505 ms. First completed diffusion block: 668 ms. Full 256-token completion: 1,780 ms AR versus 668 ms diffusion. Measure time to useful output, complete-request latency and task success separately. Original schematic. No claim about the release behavior of a particular serving API.
Our synthetic timing example distinguishes first stable output from full completion. It is a simplified service policy, not a measurement of DiffusionGemma's API.
Research notes: the problem, approach and results
256

tokens per canvas, Table 2

19.74

mean tokens per forward, Table 3

1,479

output tokens/s; H100, FP8, batch 1, Table 3

THE PROBLEM

Sequential decoding leaves hardware underused at low batch sizes.

THE IDEA

Adapt an autoregressive model to refine 256-token blocks using diffusion and a learned fast sampler.

THE RESULT

The report demonstrates fast low-batch decoding with measurable quality losses and different high-batch behavior.

02

Why it matters to an FDE

An interactive assistant may spend much of its time moving weights and attention state rather than doing useful arithmetic. Generating several positions together can use that hardware more effectively. That makes diffusion worth investigating for latency-sensitive generation, especially when the output contains predictable structure or copies from the input.

The customer still experiences queuing, prompt processing, tool calls and validation. A system that finishes text quickly can remain slow to produce its first useful answer. It can also require more correction if the model's instruction following or tool-use success changes.

Start with inference serving and continuous batching. Compare this paper with speculative decoding: a verified draft can preserve a target distribution, while direct diffusion generation trades into a different quality-speed operating point. That distinction determines what must be revalidated before changing a customer's model.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 199 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>2 runnable code blocks
  • ▦3 results tables
  1. 03Key takeaways

    Six distinctions that keep a diffusion-serving evaluation honest

    Free account
  2. 04How it works

    Follow autoregressive adaptation, bidirectional block attention and a fast learned sampler

    Premium
  3. 05The numbers that matter

    Read the speed result beside quality regressions and the exact measurement conditions

    Premium
  4. 06Try it yourself

    Calculate first-output and completion latency for a simplified block-release service

    Premium
  5. 07Where it breaks

    Recognize quality loss, repetitive output and parsing issues before using the fastest mode

    Premium
  6. 08Using it on a deployment

    Pilot a diffusion model with explicit output contracts, matched quality gates and load tests

    Premium
  7. 09Interview angles

    Explain when parallel refinement helps and what a responsible serving comparison must hold fixed

    Premium
Back to the paper library →