LiFT: Loop Flow Transformers

Mohammad Mahdi Derakhshani, Pedro M. P. Curvo, Gertjan J. Burghouts, Jan-Willem van de Meent, Cees G. M. Snoek

University of Amsterdam · TNO

Published October 4, 2026 · on the feed October 6, 2026 · ▲ 12 · arXiv 2610.05538

Image generation & editing No code arXiv ↗Hugging Face ↗

The abstract

We introduce Loop Flow Transformers (LiFT), a family of looped generative models that scales computation by repeatedly applying a shared Diffusion Transformer (DiT) core, with only light changes to the standard architecture. Rather than asking every recurrent step for the final prediction, LiFT trains each step with a single regression target: a point on a straight path from the model's initial estimate to the flow-matching target. Because we index these targets by a continuous depth coordinate, a trained model can loop far beyond its training depth with no retraining, early exits, or other modifications. In our experiments, these longer rollouts improve generation, so inference computation can grow without adding parameters. On ImageNet at 256x256, LiFT-L/2 achieves an FID 3.34 points lower than our dense DiT-XL/2 baseline while using approximately 60% fewer parameters, 32% fewer training FLOPs, and 52% fewer inference FLOPs.

The Brief

1:46

A short podcast summary of the paper. Written and voiced by AI.

Transcript

LiFT. Loop Flow Transformers. By Mohammad Mahdi Derakhshani and four others, from the University of Amsterdam and TNO. Published on the fourth of October. No code repository is linked to it.

A looped generative model scales computation by applying the same core over and over, rather than stacking more distinct layers. That raises a training question: what should each pass be asked to produce? One answer is to ask every recurrent step for the final prediction, so every step is judged against the finished output.

Loop Flow Transformers, or LiFT, take a different route. They are a family of looped generative models built by repeatedly applying a shared Diffusion Transformer core, with only light changes to the standard architecture. Each step is trained with a single regression target: a point on a straight path that runs from the model's initial estimate to the flow-matching target. Each loop is asked to get part of the way there, not all of it.

Those targets are indexed by a continuous depth coordinate. Because depth is continuous rather than a fixed count, a trained model can loop far beyond the depth it was trained at, without retraining, early exits, or any other modification. In the authors' experiments, those longer rollouts improve generation, so inference computation can grow without adding parameters.

On ImageNet at two hundred fifty-six by two hundred fifty-six, LiFT-L/2 reaches an FID three point three four points lower than the authors' dense DiT-XL/2 baseline. It does so with roughly sixty percent fewer parameters, thirty-two percent fewer training FLOPs, and fifty-two percent fewer inference FLOPs.

One straight path, indexed continuously, is what turns depth into a dial. More loops at inference means more computation, and the parameter count stays where it was.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.