Technical Report · ByteDance Seed · 2026

Scaling Properties of Text Conditioning
in Visual Generation

Zilong Chen  ·  Chaorui Deng  ·  Kunchang Li  ·  Hongyi Yuan  ·  Haoqi Fan

ByteDance Seed

Abstract

We study empirical scaling properties for text conditioning in visual generation. Such properties have rarely been measured because diffusion loss does not scale with the number of tokens in natural-language prompts. Surprisingly, we find that the converged diffusion loss scales with the amount of structured language in the prompt. To quantify structured language, we adapt two complementary measures: a white-box likelihood metric (GPG) and a black-box attribute metric (ED). Across controlled training runs, the converged diffusion loss decreases approximately linearly with GPG and follows a power law with ED.

Guided by these scaling properties, we improve diffusability by constructing structured prompts with semantic and geometric annotations derived from images, and improve promptability by training a prompter through supervised fine-tuning, cold-start, and verifier-gated on-policy distillation. The resulting system outperforms all evaluated open-weight models on nearly every compositional, reasoning, and world-knowledge benchmark, while matching or surpassing the strongest closed-weight models on most evaluations.

The system, end to end


The bottleneck is information, not length

Text-to-image generation inherited language modelling’s recipe — bigger backbones, more data, more compute. On simple prompts this translates cleanly into quality. On the prompts people actually find hard — multi-object compositions, precise spatial layouts, attribute–object binding, world-knowledge probes — it has stalled.

There is a reason the analogy breaks. A language model learns from the text stream itself; a text-to-image model can only learn to render what its captions expose about the pixels. Visual content a caption omits, or binds ambiguously, stays in the image but is weakly supervised. So the image-grounded information a caption carries is a fourth axis — parallel to model, data, and compute — that bounds what a diffuser can learn to recover from text, yet it has rarely been treated as an explicit training variable.

The natural fix would be longer, more detailed captions. We show that does not work — because length and information are not the same thing. Lengthening a natural-language caption typically adds paraphrase, discourse connectives, and implicit cross-references; it rarely adds new image-grounded conditioning content per token. The optimizer sees more text but no more signal, and the saturation on long-prompt benchmarks is the predictable consequence.

We make this concrete with a fixed-backbone reconstruction probe. A caption is informative to the extent that a diffuser conditioned on it can reproduce a held-out reference image. Using the same Qwen-Image backbone and seed, we reconstruct one reference from natural-language captions of increasing length and from structured prompts of increasing schema coverage, and read off image-side similarity (DINOv3, SigLIP2, and LPIPS).

reference photograph to reconstruct Reference
L5NL · 470 tok
L6NL · 695 tok
L8NL · 1,322 tok
L10NL · 2,130 tok
Natural language
NL L5 reconstruction
DINOv3 0.51SigLIP2 0.36 · LPIPS 0.68
NL L6 reconstruction
DINOv3 0.48SigLIP2 0.36 · LPIPS 0.69
NL L8 reconstruction
DINOv3 0.46SigLIP2 0.33 · LPIPS 0.69
NL L10 reconstruction
DINOv3 0.51SigLIP2 0.36 · LPIPS 0.68
Structured prompt
SP L5 reconstruction
DINOv3 0.41SigLIP2 0.32 · LPIPS 0.72
SP L6 reconstruction
DINOv3 0.60SigLIP2 0.44 · LPIPS 0.62
SP L8 reconstruction
DINOv3 0.61SigLIP2 0.45 · LPIPS 0.60
SP L10 reconstruction
DINOv3 0.65SigLIP2 0.46 · LPIPS 0.59
A fixed-backbone probe separates information from length. From one held-out reference (left), the same Qwen-Image backbone reconstructs it from natural-language captions (NL, top) and structured prompts (SP, bottom) at four levels. The NL captions keep the same entities and relationships while growing from 470 to 2,130 tokens, yet all three metrics stay flat; restoring SP fields improves them steadily (DINOv3 / SigLIP2 cosine, higher is better; LPIPS distance, lower is better; green marks improvement over L5).

The natural-language reconstructions barely change as the caption grows; the structured ones get steadily more faithful. The constraint is the caption format, not its length — which points to a fourth scaling axis, parallel to and independent of model, data, and compute: the information content of the caption itself.

Two metrics for caption information

To treat “information” as a scaling quantity we have to measure it. We use two metrics with deliberately different assumptions, so that their agreement means something.

Grounded Perplexity Gain (GPG) is white-box. Fix a frozen vision–language judge (here Qwen3.5-397B-A17B) and, for each content token of a caption, measure the log-likelihood it gains once the image is revealed. Summed over the caption, this is the empirical mutual information between caption and image under that judge — how much the picture “explains” the words. A caption full of precise, image-grounded detail scores high; one full of generic prose scores low no matter how long it is.

reference image: a silver pickup truck loaded with cardboard boxes

“A silver pickup truck transports cardboard boxes, a wrapped cylinder, and Coca-Cola cans on a street.”

illustrative data — each bar is a token’s surprisal under the judge. The blue base is the surprisal that remains with the image; toggle the image off and the amber part grows — how much the picture explains, the per-token grounding gain. Their sum is GPG. Grounded tokens (silver, truck, cardboard) light up; filler (a, on, and) barely moves.

Effective Detailness (ED) is black-box. It never looks at log-probabilities. Instead it extracts the attribute tuples a caption asserts — colors, materials, positions, relationships — and scores their precision and recall (F0.5, weighting precision over recall, so hallucinated attributes are punished more than missing ones) against an image-grounded source set. The image side is extracted once, offline, by Gemini 3 Pro; caption extraction and matching are then pure text-to-text (GPT-5.4), with no log-probabilities in the loop.

reference image: a silver pickup truck loaded with cardboard boxes
✗ not in the image

hover a tuple → its region

the caption asserts

the image contains (source set)

Precision
Recall
ED = F0.5(P, R) =

illustrative datagreen tuples appear in both (matched); red are in the caption only (hallucinations — they lower precision); grey are in the image only (missed — they lower recall). ED weights precision over recall (F0.5), since a hallucinated attribute hurts generation more than a missing one.

The two metrics share almost no machinery: one queries a model’s internal probabilities, the other compares extracted facts. If either were merely reflecting its own idiosyncrasies — a judge’s distribution, an extractor’s vocabulary — they would rank captions differently. That they do not is the first sign both are tracking something real.

The text prompt scaling law

With a way to measure caption information, we can ask whether it predicts anything. It predicts the central quantity in diffusion training: the converged loss.

We assemble 15 caption configurations from one set of full image annotations — three natural-language controls, the six nested structured-prompt levels (L5–L10), three spatial-grid variants, and three field ablations — and train a separate diffuser (a shared BAGEL checkpoint) on each to a common budget of 2.84×1010 image tokens, holding the images, architecture, and optimisation fixed so the caption is the only changing variable. Then we plot converged MSE against each information metric. Hover any point below for its values.

The law, both rulers. Converged training MSE across all 15 cells, plotted against caption information two ways: (a) linear in the white-box GPG estimate (r = −0.984) and (b) a power law in the black-box ED attribute recall (r = −0.971). Built from disjoint machinery, the two rulers rank every cell the same way. Hover any point for its values.
MSE = 0.4549 − 8.45×10−5·GPG   (r = −0.984)
MSE = 0.4200·ED−0.2073   (r = −0.971)

Read it family by family. Natural-language cells (red squares) cluster at the left — GPG ≈ 110, creeping up only slightly as the caption lengthens (GPG is a token sum) — while their losses barely move. Structured prompts (blue circles) march down the line as the schema grows richer. Spatial variants and field ablations land exactly where their GPG predicts. Length appears nowhere in the law; information is everything.

The slope has a clean reading: it is an exchange rate. Every nat of caption information buys a fixed reduction in training loss, regardless of where that nat comes from. And the law is not a fragile fit. Fit on the natural-language and nested-SP families alone, it predicts the six held-out spatial and field variants to mean-absolute MSE errors of 5.0×10−4 (GPG) and 8.1×10−4 (ED); its residual standard deviations are ≈ 6×10−4 and ≈ 7.8×10−4; budget-wise refits preserve both relations; and the two rulers, built from disjoint machinery, rank all 15 cells the same way (ρSpearman = 0.96). The law tracks caption information itself, not either metric’s design.

A scaling law is only useful if you can move along it. Caption information factorises into two levers we can raise independently — schematically, Quality ≈ Diffusability × Promptability. Diffusability is the quality ceiling a caption format affords; Promptability is how much of that ceiling a real prompter reaches. The next two sections raise each in turn.

Raising Diffusability: the structured-prompt schema

Diffusability is a property of the caption format, so we raise it by replacing free-form prose with a typed JSON schema in which every conditioning axis has its own addressable slot: a global intent; a scene block; per-element entries with explicit bounding boxes, depth, materials and pose; inter-element relationships that reference those boxes; and a photography block for global camera parameters. Each token now populates a field value — a coordinate, an attribute, an element index — rather than extending a sentence, so the length actually carries conditioning information.

a dark luxury living room described by the structured prompt

Every object is its own addressable slot — a bounding box, a depth, a caption, and typed attribute fields. Foreground elements and scene elements together tile the whole image; the prompter fills each slot, and the diffuser renders from them. Hover to locate a slot; click to pin its fields; “show all regions” reveals the full layout.

Populating this schema for every training image is a heterogeneous perception problem, so we build it with a five-stage pipeline of frozen domain experts. A VLM (Seed-VL) recovers the global scene and per-element semantics; Sapiens contributes 133 pose keypoints for human elements, DepthAnything V2 estimates relative depth, and SAM 2.1 supplies masks and occlusion cues; a final VLM pass reconciles this evidence — kept as intermediate signal, never copied into the schema as raw predictions — into one coherent full-schema (L10) SP. To separate schema richness from annotation quality, the six controlled levels below are then derived from each L10 record by deterministic field removal, so richness varies without re-annotating the image.

L5 intent + element captionsbase schema 447 tok · GPG 112 · .4466
L6 + bounding boxesper-element position 542 tok · GPG 128 · .4438
L7 + scene backgroundsetting, surfaces 647 tok · GPG 142 · .4428
L8 + dynamic attributesmaterial, state, pose 803 tok · GPG 165 · .4407
L9 + depth & relationshipsordering, references 1062 tok · GPG 192 · .4384
L10 + element photographyfull schema 1374 tok · GPG 210 · .4370

Restoring one field group at a time nearly doubles GPG, from 112 to 210, and walks the converged loss straight down the scaling law, 0.4466 → 0.4370. Ablating each group from the full L10 schema, retrained at the same budget, shows where the information lives. Scene background dominates: removing it costs 42 GPG nats and +35×10−4 MSE, a substantially larger loss increase than any other field. Bounding boxes are second: removing them costs only about 6 GPG nats yet still +14×10−4 MSE — explicit coordinates help the diffuser more than the judge’s score alone reveals. Removing depth, relationships, or atmosphere/lighting changes the loss by at most 1.5×10−4. The schema we ship is one high-Diffusability instantiation; the scaling law makes the design falsifiable — any format that scores higher on the rulers should land lower on the loss curve.

Addressable fields have one more consequence. Because the structured prompt annotates the image exhaustively, changing a single field and re-rendering alters exactly that aspect while the rest of the composition stays put — the fields are honoured independently and faithfully. Each edit below is zero-shot on the fixed backbone and touches one field; the Move edit also overlays the old (dashed red) and new (green) bounding boxes.

Raising Promptability: training the prompter

At inference there is no image to copy from — only a user’s request. The prompter has to reason the unstated visual details into place and emit a complete structured prompt in a single pass (the animation at the top of the page walks through one such pass).

A schema’s ceiling is only worth as much as the prompter that fills it. Promptability is how reliably an LLM populates the schema’s slots with precise, internally consistent values rather than generic or contradictory ones. The failure modes are specific. A weak prompter emits valid JSON but fills it with safe, photogenic defaults — a centred subject, a clean background — collapsing the very compositional variety the schema exists to express. Or it writes coordinates and relationships that contradict one another, which the diffuser then cannot satisfy. A strong prompter realises near the ceiling; a weak one wastes most of it. And because at inference there is no reference image, Promptability shows up directly as realised generation quality.

It is raised by two complementary forces. The first is scale. Across the Qwen3.5 family, from 0.8B to 397B, GenEval++ accuracy climbs from 46.4% to 86.8%, still rising in the mixture-of-experts regime. Letting the prompter reason in a chain of thought helps too, sharpening the finer structure and preference metrics at every size except the smallest — where the 0.8B model tends to loop before producing valid JSON. Because the diffusion backbone is frozen throughout, progress in language models propagates straight into image quality with no retraining of the renderer: the prompter is a scaling lever in its own right, and every advance in open LLMs is an advance in generation.

Backbone frozen throughout: across the Qwen3.5 family (0.8B → 397B), generated-image quality climbs with prompter scale on all four measures — (a) GenEval++ alignment, (b) WISE world-knowledge, (c) GPT-5.4 structure, and (d) GSB net preference. Chain-of-thought reasoning (thinking) adds a further margin at nearly every size, most clearly on structure and preference; the exception is the smallest 0.8B model, which loops before emitting valid JSON. Hover any point for values.
The training recipe three training stages on a frozen backbone, each fixing the last one’s failure mode  ·  illustrative numbers, Tab. 4
Base zero-shot Qwen3.5defaults to canonical layouts struct 4.9
+ SFT structured-prompt distributionlearns non-canonical layouts struct 6.3 · GSB 23
+ Cold-start image-grounded chain of thoughtderive from the prompt alone struct 6.8 · GSB 29
+ RFT verifier-gated OPSDgate rollouts, distil the teacher struct 7.6 · GSB 42
Trained prompter + optional agentic looprender · inspect · refine ≤ Tmax DPG-Bench 90.7
Verifier-gated OPSD — the verifier decides which rollouts train; OPSD decides toward what
QA verifier gates accepted rollouts coverage, structure, aesthetics a gate, not a reward OPSD distils an image-conditioned teacher into the image-free student on-policy

The second force is the three-stage training pipeline above; what each stage actually does is worth spelling out. SFT teaches the structured-prompt distribution — which field combinations actually occur in real images. A base model, pre-trained on image–caption pairs, has only ever seen photogenic compositions, so asked for “a book with only its left half in frame” it quietly re-centres it. After fine-tuning on our SP corpus the prompter instead emits a bounding box that runs past the canvas edge, and the diffuser renders the truncation faithfully. SFT is the single largest jump (structure 4.9 → 6.3, GSB to 23%) — what it adds is distributional knowledge of structured prompts, not format syntax.

Hover a box to read its element caption.

Two DPG-Bench prompts — a pair of glasses with a book, and a man with an acoustic guitar — each generated before vs after prompt-to-SP fine-tuning, with the structured prompt’s bounding boxes drawn on the resulting image. Before SFT the prompter scatters the scene across many loosely-grounded, overlapping regions; after SFT it commits to a compact, well-grounded layout and the generation reads as one coherent scene. Toggle the boxes; hover any box for its caption. Real structured prompts & generations, DPG-Bench.

Cold-start grafts an image-grounded chain of thought. We distil (prompt → reasoning → JSON) traces from a teacher that is shown the reference image but is system-prompted to frame its reasoning as a derivation from the user’s prompt alone — never “I see X in the image.” A Gemini judge keeps only the traces whose reasoning is consistent with the caption, image, and target SP. The student learns that derivation style; at inference, with no image in hand, it reconstructs an admissible analysis from the prompt before emitting the schema. This is what lets a single forward pass produce a globally consistent layout rather than a bag of locally plausible fields.

RFT then moves training onto the prompter’s own rollouts. The fixed diffuser renders each one, and a QA verifier accepts or rejects it, screening for prompt coverage, structure, and aesthetics. Crucially the verifier is a gate, not a reward: it cannot supervise the plausible visual detail a request leaves unspecified, so the parameter update comes instead from OPSD — on-policy self-distillation from a frozen teacher that sees the reference image, matching its next-token distribution along the accepted rollout into the image-free student. Neither the verifier score nor GPG is optimised directly. This verifier-gated OPSD lifts structure 6.8 → 7.6 and human GSB to 42% over the base prompter, while DPG-Bench — near-saturated for every variant — reaches 90.71.

The three-stage prompter-training pipeline. (a) SFT learns the target structured-prompt distribution from (prompt, SP) pairs. (b) Cold-start bootstraps an image-free prompt → chain-of-thought → SP derivation from privileged image-conditioned traces. (c) RFT renders the student’s own rollouts; a QA verifier gates the accepted trajectories, and OPSD distils a frozen, image-conditioned teacher into the image-free student. Only the student is updated.

Training front-loads the correction into a single forward pass. But when we still want to spend more compute at generation time, the same structured interface lets us do it on the prompt side — the subject of the next section.

Agentic inference: refine–render–judge

The prompter’s SP is a single shot, but nothing stops us from rendering it, looking at the result, and revising. Because the schema exposes every visual decision as a named field, a critique of the image becomes a targeted edit of a few slots rather than a rewrite of the whole caption — which makes an agentic loop natural here in a way it is not for free-form prose.

The loop keeps the previous prompts and the critique history as explicit state. At round t, the prompter turns the user request plus the accumulated critique into SPt; the fixed diffuser renders It; and an online Gemini judge — which sees only the image, never the SP — returns per-axis scores over structure, alignment, and aesthetics with a PASS/FAIL decision and a list of observed failures. A PASS returns the image; a FAIL appends the critique so the next round revises the offending objects, attributes, relations, or layout. Repeated failures license progressively broader edits — from a local field tweak, to regrouping elements, to re-planning the whole scene. The loop stops at PASS or Tmax.

The agentic inference-time loop. The prompter emits SPt from the request and accumulated critique; the diffuser renders It; the online judge scores the image alone and returns PASS or a field-level critique that is appended to the state. Step through an illustrative trajectory (the failure categories — structure, granularity, layout — are the paper’s).

Does spending these rounds pay off? Both prompters improve with Tmax, but the gains are concentrated in structure, not basic alignment — the feedback mostly repairs object decomposition, relations, and layout, exactly the failures the schema makes addressable. And the returns saturate quickly.

Agentic inference-time scaling. GSB net preference (a) and GPT-5.4 structure score (b) as the refinement budget Tmax grows, at fixed schema, diffuser, judge, and prompter weights. The trained prompter (blue) starts far above the zero-shot Base (grey) and clears the strongest multi-turn coding agent by two rounds; both curves flatten by four. Hover any point for values.

The takeaway cuts against the usual “just add inference compute” story. At Tmax = 8 the trained prompter reaches 54.3% GSB, above the 44.7% of the strongest coding agent — which is itself already multi-turn — while reaching PASS in about 2.3 rounds on average (vs 3.41 for Base). Training absorbs most of the work iteration would otherwise pay for: it lifts the starting point and shortens the trajectory. Once the prompt-side specification is substantially right, more rounds cannot fix how the diffuser renders it — so the bottleneck, having moved from the model to the caption, moves back to the model. Agentic inference complements training here; it does not replace it.

Results

Put together — structured captions measured by GPG and ED, produced by a scaled, verifier-gated prompter — the system leads open-weight text-to-image models on nearly all compositional, reasoning, and world-knowledge benchmarks, single-shot, with the diffusion backbone held fixed, and matches the strongest closed systems on most. The benchmarks probe complementary skills: object-centric and compositional alignment (GenEval, GenEval2), dense and information-intensive prompt following (DPG-Bench, TIIF), world knowledge (WISE), and composition-plus-reasoning (CoReBench). Among open-weight systems it leads every column but one — TIIF-short, where it trails Emu3.5 by 0.4 points (89.1 vs 89.5).

A same-architecture control isolates the interface from scale and extra training. Against the original Qwen-Image, the complete system raises GenEval2 Soft-TIFA GM from 33.8 to 72.5 and CoReBench from 58.9 to 85.2. More stringently, retraining that same diffuser and prompter on the same images, stages, and budgets but with a free-form natural-language interface (Matched NL) stays near the official prompt enhancer (GM 36.5 vs 36.1; CoReBench 76.1 vs 74.7), while the structured system reaches 72.5 and 85.2. The gain comes from the structured interface and its supervision, not from more training.

ModelGenEvalGenEval2
AM / GM
DPGTIIF
s / l
WISECoReBench
without prompt enhancement
FLUX.1 Dev0.6767.1/21.183.8471.1/71.80.5042.2
OmniGen20.8083.5742.9
Emu3.50.8687.4689.5/88.20.57
BAGEL0.8285.0771.5/71.70.5238.2
Qwen-Image0.8780.8/33.888.3286.1/86.80.6258.9
with prompt enhancement
BAGEL + CoT0.8870.9/23.10.7041.1
GPT-Image-10.8485.1589.2/88.30.8072.6
Nano Banana0.8982.8/44.685.230.8975.9
LongCat-Image0.8786.800.6559.6
HunyuanImage 3.00.7286.100.5758.7
Qwen-Image*0.9182.4/36.187.2088.3/88.40.8374.7
Matched NL + Qwen-Image0.9182.4/36.587.8088.5/88.00.8476.1
Ours (Qwen-Image)0.94 90.6/72.590.71 89.1/89.20.8985.2

Representative systems as of July 2026; higher is better. GenEval: object accuracy. GenEval2: arithmetic / geometric mean of Soft-TIFA. DPG, TIIF (short/long): dense / information-intensive following. WISE: world knowledge. CoReBench: composition and reasoning. “PE” = prompt enhancement; Qwen-Image* uses its official PE; Matched NL retrains the same diffuser + prompter under our budgets but with free-form NL captions. our re-evaluation on Qwen-Image-2512. Ours is single-shot, with no agentic iteration.

Qualitatively, higher-information conditioning shows up on the cases most systems fail: multi-object scenes with correct counts and layout, legible dense text, infographics and UI mockups, branded illustration. None of it comes from a larger diffusion model — the backbone is unchanged; the gain is a higher-information conditioning stream.


Prompt-to-image case showcase


Citation

@article{chen2026scaling,
  title   = {Scaling Properties of Text Conditioning in Visual Generation},
  author  = {Chen, Zilong and Deng, Chaorui and Li, Kunchang and Yuan, Hongyi and Fan, Haoqi},
  journal = {Technical Report, ByteDance Seed},
  year    = {2026}
}