Learning on the Manifold: Unlocking Standard Diffusion Transformers with Representation Encoders
Amandeep Kumar, Vishal M. Patel
TL;DR
This work identifies a geometric mismatch—the Geometry Gap—between Euclidean diffusion objectives and hyperspherical latent spaces produced by representation encoders, which causes standard diffusion transformers to fail to converge. It introduces Riemannian Flow Matching with Jacobi Regularization (RJF), enforcing geodesic trajectories on the hypersphere and curvature-aware loss weighting to account for geodesic focusing. RJF enables conventional Diffusion Transformer architectures to learn on representation encoders without width scaling, achieving state-of-the-art FID and IS on ImageNet (e.g., FID $=3.37$ with guidance and $=4.95$ without) and demonstrating robust generalization across architectures and encoders. By aligning the generative process with the latent topology, RJF delivers efficient, high-fidelity generation, validating the practicality of diffusion models directly in representation spaces.
Abstract
Leveraging representation encoders for generative modeling offers a path for efficient, high-fidelity synthesis. However, standard diffusion transformers fail to converge on these representations directly. While recent work attributes this to a capacity bottleneck proposing computationally expensive width scaling of diffusion transformers we demonstrate that the failure is fundamentally geometric. We identify Geometric Interference as the root cause: standard Euclidean flow matching forces probability paths through the low-density interior of the hyperspherical feature space of representation encoders, rather than following the manifold surface. To resolve this, we propose Riemannian Flow Matching with Jacobi Regularization (RJF). By constraining the generative process to the manifold geodesics and correcting for curvature-induced error propagation, RJF enables standard Diffusion Transformer architectures to converge without width scaling. Our method RJF enables the standard DiT-B architecture (131M parameters) to converge effectively, achieving an FID of 3.37 where prior methods fail to converge. Code: https://github.com/amandpkr/RJF
