Intrinsic Distribution Matching
Deyuan Liu, Yansen Han, Kaiwen Zheng, Jun Xie, Jiacheng Liu, Zhenglin Cheng, Peng Sun, Jintao Zhang and 2 others
Inclusion AI · Westlake University · Tsinghua University · Zhejiang University · Shanghai Innovation Institute · MBZUAI
Published October 29, 2026 · on the feed October 30, 2026 · ▲ 37 · arXiv 2610.39633
The abstract
One-step and few-step text-to-image generation must accurately render the details specified in the prompt despite limited opportunities for refinement. Distribution matching distillation (DMD) uses score differences to bring the generated distribution closer to a reference distribution. Following prior work, we estimate this difference with internal velocity branches, avoiding a separate fake-score network. We ask whether an explicit moment constraint improves this learned score supervision. A decomposition of the reverse-KL field into a Gaussian moment component and a non-Gaussian residual identifies statistics that can be constrained explicitly. We introduce Intrinsic Distribution Matching (IDM), which retains the full DMD correction and matches feature means and per-coordinate standard deviations using the generator's exponential-moving-average (EMA) copy, requiring no external feature encoder. Experiments use full-parameter and low-rank adaptation (LoRA) tuning on Z-Image-Turbo 6B and Qwen-Image 20B. At two network evaluations, IDM reaches 94.25% and 90.20% on Chinese and English LongText-Bench, the highest scores among the compared methods at this budget. Controlled ablations show gains from the added moment loss, while generator EMA features perform competitively with an external DINOv2 encoder across the five reported metrics. Code is available at https://github.com/inclusionAI/IDM.
The Brief
2:13A short podcast summary of the paper. Written and voiced by AI.
Transcript
Intrinsic Distribution Matching. By Deyuan Liu and nine others, from Inclusion AI, Westlake University, and four other institutions. Published on the twenty-ninth of October.
Text-to-image generation in one step, or in a few, has to render the details a prompt asks for, with very little opportunity to refine. Distribution matching distillation, or DMD, addresses this by using score differences to pull the generated distribution toward a reference distribution. Following prior work, the authors estimate that difference with internal velocity branches, which avoids training a separate fake-score network. Their question is whether an explicit moment constraint would improve this learned score supervision.
The answer starts from a decomposition. The reverse-KL field splits into a Gaussian moment component and a non-Gaussian residual. That split identifies statistics that can be constrained explicitly, rather than left entirely to the learned score. Put another way, part of what the score supervision is trying to correct can be named directly, as means and spreads, and those can be matched on purpose instead of only being reached indirectly.
Intrinsic Distribution Matching, or IDM, keeps the full DMD correction and adds to it. It matches feature means and per-coordinate standard deviations, and the features come from the generator's own exponential-moving-average copy. So no external feature encoder is required. Experiments cover both full-parameter tuning and low-rank adaptation, LoRA, on Z-Image-Turbo 6B and on Qwen-Image 20B.
At two network evaluations, IDM reaches ninety-four point two five percent on the Chinese LongText-Bench, and ninety point two percent on the English one. These are the highest scores among the methods compared at that budget. Controlled ablations attribute gains to the added moment loss. And features taken from the generator's moving-average copy perform competitively with an external DINOv2 encoder, across the five metrics reported.
The design adds a constraint without adding a component. The moment loss sits alongside the full DMD correction rather than replacing it, and the features it matches come from a copy of the generator already on hand. Nothing outside the model is consulted. The statistics being matched are intrinsic to the model being trained, and the ablations suggest that this does not cost much against borrowing features from an external encoder, while the explicit moment loss itself is where gains were measured.
Paper Quest · 7 chapters · about 41 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
One or two steps to draw a page of legible text. Here is the squeeze.
You are distilling a big text-to-image model into one that draws in one or two steps. With so few steps there is little room to fix details, and long text inside an image must stay legible.
The road ahead
- 1 · The problem ~7 min A generator that draws in one or two steps gets little chance to fix details, and its learned training signal can leave gaps.
- 2 · What came before ~3 min
- 3 · The key idea ~9 min Keep the full score-difference correction, and add a loss that matches feature means and standard deviations, read from the generator's moving-average copy.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Decompose the field to choose the statistics, keep the internal DMD correction, read features with the EMA copy, then match their means and spreads.
- 6 · The experiment ~6 min You’ll guess: In ablations, how did features from the generator's own EMA copy compare with an external DINOv2 encoder?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.