Looped Diffusion Transformer

Just loop it! More depth, not more parameters.

Yong Xien Chng*†1,2, Tianyi Chen*1,2, Wenwen Tong1, Haiwen Diao3, Zhongang Cai1,
Lei Yang1, Ziwei Liu3, Lewei Lu1, Dahua Lin1, Gao Huang‡2

1SenseTime Research 2LeapLab, Tsinghua University 3Nanyang Technological University
*Equal contribution   †Project lead   ‡Corresponding author

Looping Improves Performance

Looping Improves Efficiency

Looping Scales with Compute

Looping Unlocks Latent Reasoning

Overview

Abstract

Improving text-to-image models has traditionally relied on increasing model size or the number of denoising steps. In this work, we explore an alternative way to scale computation by repeatedly running shared Transformer blocks within each denoising step, effectively increasing computational depth while keeping the parameter count fixed. This looped computation enables iterative refinement of internal representations without explicit reasoning tokens. However, naive looping fails to consistently improve image quality. We trace this problem to weak supervision across intermediate loops and unregulated attention updates that progressively erode local information. To overcome these challenges, we propose Looped Diffusion Transformer (Looped-DiT), which combines deep supervision across intermediate loops with self-modulating attention to stabilize looped feature updates. Under matched-parameter and matched-compute settings, Looped-DiT consistently outperforms non-looped baselines. Notably, a 260M-parameter looped model can surpass a model 6.5× larger across multiple text-to-image benchmarks while requiring 4.9× lower inference compute. Beyond this performance gain, we find that looped computation can offer a more effective form of iterative computation for diffusion models, with increasing loop depth yielding larger gains than adding more denoising steps under a fixed inference budget. Furthermore, deeper loops can progressively correct mistakes made in earlier loops, exhibiting behaviors suggestive of latent reasoning. Together, these results show that looped computation offers a promising way to scale visual generation models.

Video

A five-minute overview

Method

How Looped-DiT works

Looped-DiT reruns the same middle blocks several times in every denoising step. Deep supervision makes every loop useful, and self-modulating attention stops later loops from overwriting.

Deep supervision

Every loop predicts the image

Supervising only the last loop leaves earlier loops without direct supervision. Deep supervision fixes this by decoding every loop and training each prediction against the clean image.

Self-modulating attention

Later loops refine, not overwrite

Plain attention can write large updates that erode earlier progress. Self-modulating attention helps preserve progress by modulating each token's update with a gate recomputed at every loop. We tested two gates, and exclusive self-attention (XSA) worked better than gated attention, so we adopt it.

Main results

Ahead of models up to 26× larger

Looped-DiT B/16 has the highest average on six benchmarks and the best score on five. The next-best model is 6.5× larger.

Analysis

How well does looping work?

Q1

Does looping work?

Yes, with the right training. Looping alone barely helps, but deep supervision and self-modulating attention unlock a clear gain.

+4.0over no looping, against +1.0 for naive looping
Q2

Does looping beat a bigger model?

Yes, with half the parameters. At equal compute, it outscores deeper and wider networks nearly twice its size.

1.9×fewer parameters
Q3

Does looping beat more denoising steps?

Yes, with half the compute. At every budget, extra loops beat extra denoising steps.

2.1×less compute, as 4 loops × 25 steps beat 1 loop × 100 steps
Looped-DiT, loop ×4Looped-DiT, loop ×1Non-looped baselineNumbers on points are denoising steps
Q4

Does looping reason without words?

Yes, it corrects its own mistakes. Later loops fix counts, layouts and text, with no reasoning tokens.

3.1×more correct words from 1 to 4 loops (LongText-Bench)
Q5

Does looping stack with chain of thought?

Yes, and together they gain the most. Looping fixes constraints that must hold together, while chain of thought fills in implied content.

+5.5with both, against +4.0 and +2.1 alone
CoT
Rewritten prompts, no looping
Looping
Looped-DiT, original prompts
Both
Looped-DiT, rewritten prompts
Components

What each component does

Deep supervision

Every loop becomes usable

Even one loop beats the non-looped model, and extra loops hold their score.

+9.8at one loop over naive looping
Deep supervisionNo deep supervisionNon-looped baseline
Self-modulating attention

Later loops write less

With XSA, updates shrink each loop and the layout survives.

1.3×more layout than naive looping after eight loops
Layout information left (position probe R²)
Size of each attention update
XSA

It helps when blocks repeat

+1.6on the looped model, against −0.1 and +0.7 without looping
Adaptive depth

Easy images stop early

A small network decides after each loop whether to stop.

1.5×fewer loops at the same score
Adaptive loopingFixed looping
Both components

Together they score highest

Deep supervision alone adds +1.3, and XSA alone adds +2.3.

+2.9over naive looping
Scope

Limitations and open questions

Scale and resolution

Our looped models are ~260M-parameter pixel-space MMDiTs at 512 × 512. Larger looped models, VAE latent-space generation and higher resolutions are untested.

Design space

We fix a [6, 5, 6] block split and four training loops. Other splits, placements and depths are largely unexplored.

Training cost

Deep supervision raises training compute about 1.54× over the deeper and wider baselines.

Evidence for latent reasoning

Our evidence is mainly behavioral and representational. We see errors corrected across loops but do not explain the mechanism or when refinement counts as reasoning.

Citation

BibTeX

@misc{chng2026loopeddiffusiontransformer,
  title         = {Looped Diffusion Transformer},
  author        = {Yong Xien Chng and Tianyi Chen and Wenwen Tong and Haiwen Diao and
                   Zhongang Cai and Lei Yang and Ziwei Liu and Lewei Lu and Dahua Lin and
                   Gao Huang},
  year          = {2026},
  eprint        = {2609.40305},
  archivePrefix = {arXiv},
  primaryClass  = {cs.CV},
  url           = {https://arxiv.org/abs/2609.40305}
}