arXiv Computer Vision

We Have Been Interpreting Diffusion Transformer Backbone Behaviors Wrong

The paper revisits the interpretation of depth profiles in Diffusion Transformer backbones, showing that the commonly observed inverted‑U curve reflects the influence of the prediction target (e.g., ε, u, x0) rather than a simple shift from coarse to fine semantic granularity. It argues that the semantically meaningful signal is merely an intermediate by‑product of predicting the target, and that different training setups—particularly the choice of prediction target—predictably alter the curve’s shape. The authors demonstrate how this new understanding can guide the optimal placement of REPA modules and provide code for further exploration.

arXiv AI
Jun 17

Rethinking Cross-Layer Information Routing in Diffusion Transformers

arXiv:2605. 20708v2 Announce Type: replace-cross Abstract: Diffusion Transformers (DiTs) have become a de facto backbone of modern visual generation, and nearly every major axis of their design -- tokenization, attention, conditioning, objectives, and latent autoencoders -- has been extensively revisited.

By Chao Xu, Maohua Li, Qirui Li, Yixuan Xu, Yanke Zhou, Yunhe Li, Cuifeng Shen, Hanlin Tang, Kan Liu, Tao Lan, Lin Qu, Shao-Qun Zhang
arXiv Computation and Language
Sep 2

Measuring Optimal Transport in Transformer Depth

The study investigates whether transformer models transport token representations across layers in a manner consistent with optimal transport theory. Using Pythia-160m and Pythia-410m, the authors measure exact assignments between consecutive layer clouds, calibrate couplings, and decompose the transport cost into common shifts and token‑specific moves. Results show that at the final layer both models align closely with the optimal‑transport map—Pythia‑410m at optimal cost and Pythia‑160m slightly above—while earlier layers deviate, and the agreement improves with training.

By Alexandre Quemy
arXiv Computer Vision
Oct 12

Why DiT Models Underperform as Representation Learners without Long Skip Connections

The paper investigates why Diffusion Transformers (DiT) produce weaker features for vision tasks compared to their strong generative performance. Through controlled training, the authors demonstrate that incorporating long skip connections (LSCs) significantly improves feature quality. They explain that LSCs allow diffusion noise to bypass the main backbone, preventing noise pollution of image signals and aligning the architecture more closely with the diffusion objective.

By Benyuan Meng, Yiliang Zhang, Jin-Wen Wu, Qianqian Xu, Qingming Huang, Longtao Huang
arXiv Machine Learning
Oct 8

Residual-Stream Burden Shapes Representation Learning in Diffusion Transformers

The paper investigates why Diffusion Transformers perform well when predicting clean data but poorly when predicting noise or velocity. It introduces the concept of *residual-stream burden*, explaining that noisy targets force the residual stream to carry noise-dependent variation through the network, limiting representation flexibility. Experiments show that spectral concentration of clean targets reduces this burden, and the authors propose Spatially Indexed Hyper-Connections (SiHC) to expand residual bandwidth, achieving state‑of‑the‑art FID on ImageNet.

By Tongtong Liang, Siqi Kou, Ziqiao Xi, Esha Singh, Kun Zhou, Zhijie Deng, Alexander Cloninger, Yu-Xiang Wang, Rahul Parhi
arXiv AI
Jul 16

DeepLoop: Depth Scaling for Looped Transformers

arXiv:2607. 13491v1 Announce Type: cross Abstract: Looped Transformers scale sequential computation by applying a compact stack of physical blocks for multiple rounds, increasing unrolled depth without increasing stored parameters.

By Shuzhen Li, Yifan Zhang, Jiacheng Guo, Quanquan Gu, Mengdi Wang
Hugging Face Trending Papers
Aug 4

DiverseDiT++: Quantifying, Analyzing, and Promoting Representation Diversity in Diffusion Transformers

Recent advances in Diffusion Transformers (DiTs) have enabled remarkable progress in visual synthesis, benefiting from their superior scalability. To facilitate DiTs' capability of capturing meaningful internal representations, recent works such as REPA incorporate external pretrained encoders for representation alignment.

arXiv AI
Oct 5

Depth as Time in One-Step Generative Models

The paper investigates how one-step generative models, which compress multi-step diffusion processes, handle denoising across a single forward pass. It introduces the concept of "depth as time," showing that intermediate layers of a model can be decoded to reveal a denoising trajectory similar to multi-step diffusion. The study finds that models trained with a time-indexed transport task, such as MeanFlow, exhibit this depthwise denoising and can be highly compressed, whereas models without such a task do not show the same behavior.

By Arnold Caleb Asiimwe, William Yang, Sanghyuk Chun, Esin Tureci, Olga Russakovsky
Hugging Face Trending Papers
Jul 15

Transforming Rank: How Architecture Navigates the Spectral Pathologies of Depth

We investigate how each component of the Transformer feedforward block architecture design determines how much rank survives across depth at initialization. We reinterpret skip connections and normalization, long understood as controlling magnitude, as mechanisms for preserving gradient rank across depth, since the very matrix multiplications and nonlinear activations that make the network expressive also reduce the rank.

arXiv Machine Learning
Sep 22

Optimizers for Diffusion Models: A Controlled Benchmark

The paper introduces the first controlled benchmark for optimizers in discrete diffusion models, evaluating seven optimizers (AdamW, Lion, Muon, SOAP, MARS, MARS‑M, Schedule‑Free) across four diffusion formulations: masked diffusion on text8, uniform diffusion on QM9 and LM1B, and Gaussian diffusion on CelebA‑64. Each optimizer undergoes the same search protocol and is retrained with full budget and multiple seeds, revealing that AdamW, while strong, is not universally optimal and that optimizers validated on autoregressive language models (Muon, MARS‑M, SOAP) can outperform tuned AdamW on certain tasks.

By Arman Bolatov, Egor Shulgin, David Li, Abduragim Shtanchaev, Sebastian U. Stich, Maxim Panov, Eric Moulines, Peter Richt\'arik, Martin Tak\'a\v{c}