aspireai.
PUBLIC EDITION

Coupling representation alignment with representation auto-encoding in one objective matched or beat SD3, REPA and RAE in FID while cutting diffusion training steps by up to 5x on ImageNet

AspireAI community · arXiv
Two diffusion-acceleration ideas have been developed separately: Representation Alignment aligns intermediate DiT features with a pretrained external model such as DINOv2, and Representation Auto-Encoders replace the pixel-space VAE with a compact tokenizer learned from self-supervised features. UniRA couples them, learning a representation-space tokenizer whose output serves as both the diffusion target and the alignment anchor, so the tokenizer, the diffusion backbone and the external representation model are co-optimized. The authors report a theoretical result that this joint optimization preserves the external model's representation quality while accelerating diffusion convergence, plus a principled weighting across reconstruction, alignment and generation objectives. On ImageNet class-conditional generation at 256x256 and 512x512 it matches or surpasses state-of-the-art DiTs in FID while reducing training steps by up to 5x, and the shared latent space also improves zero-shot classification and linear probing. The limitation is that this is ImageNet class-conditional generation, not text-to-image at scale, and the results are pre-submission to ICML 2027 rather than peer-reviewed.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.