RiT: Vanilla Diffusion Transformers Suffice in Representation Space
Summary
The paper introduces RiT, a vanilla Diffusion Transformer trained on frozen DINOv2 features using flow matching with x-prediction, achieving competitive FID scores on ImageNet 256×256 with fewer parameters and fast sampling without distillation.
View Cached Full Text
Cached at: 05/22/26, 02:32 AM
Paper page - RiT: Vanilla Diffusion Transformers Suffice in Representation Space
Source: https://huggingface.co/papers/2605.21981
Abstract
Flow matching in representation spaces with improved statistical properties enables efficient diffusion model training with reduced parameters and fast sampling.
Flow matchingwith x-prediction -- regressing the clean data point rather than theambient velocity-- is known to exploitlow-dimensional manifoldstructure effectively in pixel space li2025back. We ask whether apretrained representation space, while containing a low-dimensional data manifold of comparableintrinsic dimensionality, offers a distribution more favorable for flow-matching learning. Comparing pixel, SD-VAE, and DINOv2 features along four geometric axes, we find that pixel and DINOv2 share nearly identical intrinsic dimensionalities (both d!approx!33) yet DINOv2 exhibits 7.3times highereffective rank, 35times bettercovariance conditioning, 11.5times lowerexcess kurtosis, and 1.7times loweron-manifold interpolation error; SD-VAE latents are consistently intermediate, indicating that the advantage stems from representation-learning objectives rather than mere compression. These statistical properties render the flow-matching regression well-conditioned and remove the need for the specialized prediction heads or Riemannian transport used by prior DINOv2 diffusion methods. We propose the Representation Image Transformer (RiT): a vanillaDiffusion Transformertrained by x-prediction on frozen DINOv2 features, augmented only by a dimension-aware noise schedule and joint [CLS]-patch modeling. On ImageNet 256{times}256, RiT attains FID 1.45 without guidance and 1.14 withclassifier-free guidance, outperforming DiT^DH-XL with 19% fewer parameters (676M vs.\ 839M). The resulting ODE is efficiently solvable at coarse discretizations: withclassifier-free guidance, 5Heun stepsalready reach FID 2.0 and 10 steps reach 1.25, without distillation or consistency training. Code at https://github.com/lezhang7/RiT.
View arXiv pageView PDFGitHub4Add to collection
Get this paper in your agent:
hf papers read 2605\.21981
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2605.21981 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2605.21981 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2605.21981 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
@elonmusk: Grok ftw
Elon Musk praises Grok's image generation after it correctly visualizes a mathematician drinking from a genus-1 object, while ChatGPT produces a genus-2 donut-mug.
@heyshrutimishra: We've been measuring image models wrong. For years it was about resemblance, then photorealism & every benchmark focuse…
The tweet argues that image models have been evaluated on photorealism instead of production readiness, then introduces SenseNova U1 Pro, built on the NEO-Unify architecture, which supports native 8K resolution and iterative design reasoning.
Update on Research PSCLS
The author shares early progress on Leo/PSCLS, an experimental system that learns sequence relationships and improves its story generation and metrics as it is trained on more stories.
How Molecular Generative Models Organize Molecular Identity
This paper investigates how molecular generative models internally organize molecular identity in their latent spaces, revealing piecewise-constant regions and coarse-to-fine boundaries across three architectures.
Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nystr\"om Method
The paper introduces NysHD, a method that bridges hyperdimensional computing and kernel methods via the Nyström approximation, allowing any positive-semidefinite similarity function to be used as an HDC encoding. It demonstrates improved classification accuracy on graph and string datasets compared to existing HDC encoding methods.