On the Diffusibility of High-Dimensional Latents
Chao Feng, Zhiyang Xu, Bowei Chen, Yuanjun Xiong, Xiyao Wang, Jui-Hsien Wang, Richard Zhang, Zhe Lin and 2 others
Cornell University · Adobe · Virginia Tech · University of Washington · University of Maryland
Published September 23, 2026 · on the feed September 24, 2026 · ▲ 7 · arXiv 2609.28473
The abstract
Representation Autoencoders (RAEs) enable diffusion models to operate in the feature spaces of pretrained visual encoders. However, many off-the-shelf encoders are not optimized for faithful reconstruction, discarding fine-grained visual details. As expected, finetuning these encoders for image reconstruction recovers such details. However, perhaps counterintuitively, this procedure reduces the effective dimensionality of the resulting representation, and the altered geometry has downstream effects on generation. Specifically, we show that using the standard velocity prediction in flow matching in this high-dimensional space requires the model to fit orthogonal noise directions outside the low-dimensional signal manifold, making optimization inefficient. This motivates using the clean data parameterization (x_{0}-prediction) instead, which focuses learning on the underlying signal manifold. Across experiments with multiple strong-reconstruction encoders, we show that x_{0}-prediction consistently improves text-to-image generation performance.
The Brief
1:47A short podcast summary of the paper. Written and voiced by AI.
Transcript
On the Diffusibility of High-Dimensional Latents. By Chao Feng and nine others, from Cornell University, Adobe, and three other institutions. Published on the twenty-third of September. No code repository is linked to it.
Representation Autoencoders let diffusion models operate in the feature spaces of pretrained visual encoders. Many off-the-shelf encoders are not optimized for faithful reconstruction, and discard fine-grained visual detail. Finetuning them for image reconstruction recovers that detail, as expected. The counterintuitive part is what else it does. It reduces the effective dimensionality of the resulting representation, and that altered geometry has downstream effects on generation.
Specifically, the authors show that standard velocity prediction in flow matching, used in this high-dimensional space, requires the model to fit noise directions that are orthogonal to the low-dimensional signal manifold. That makes optimization inefficient. It motivates switching to the clean data parameterization, x zero prediction, which focuses learning on the underlying signal manifold. Across experiments with multiple strong-reconstruction encoders, x zero prediction consistently improves text-to-image generation.
The result is stated for representation autoencoders built on encoders with strong reconstruction, for flow matching, and for text-to-image generation. The contrast it draws is between two parameterizations, velocity prediction and clean data prediction, in a space that is high-dimensional while its signal lies on a lower-dimensional manifold.
A better encoder in the reconstruction sense is not automatically an easier space to diffuse in. When the signal occupies fewer dimensions than the space offers, predicting the clean data rather than the velocity keeps the model's effort on the directions that carry signal, instead of on the noise around them.
Paper Quest · 7 chapters · about 40 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Better features, worse training. Something about finetuning made the generator stall.
You are training a text-to-image generator that works in the feature space of a pretrained visual encoder instead of raw pixels. Those features are rich in meaning but drop fine detail: text, textures, small objects.
The road ahead
- 1 · The problem ~7 min Finetuning a visual encoder to keep fine detail makes its features hard for a text-to-image generator to learn, and shrinking them loses information.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Reconstruction finetuning squeezes the features near a small subspace, so predict the clean features instead of velocity and skip the noise.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Take an encoder's features, finetune it for reconstruction, train a generator to predict clean features, then generate images from text.
- 6 · The experiment ~6 min You’ll guess: When a pretrained visual encoder is finetuned for image reconstruction, what happens to the effective dimensionality of its features?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.