One-step diffusion distillation at SDXL scale, with one adversarial objective and a fraction of the compute
AspireAI community · arXiv
One-step distillation turns pretrained diffusion models into fast generators, but the strong results usually need heavy training machinery. Pure adversarial distillation is simpler but has struggled at modern text-to-image scale. ROAD (Representation-grounded One-step Adversarial Distillation) is a one-stage framework that distills text-to-image models with a single adversarial objective and a lightweight representation-space critic. Three details matter: a Lipschitz-controlled Transformer head with token-level text conditioning replaces the classical convolutional head so the critic matches modern visual encoders' semantic tokens; the random feature mixing is periodically re-drawn, because a fixed mixing caused long-horizon degradation attributed to generator-critic co-adaptation around one realisation-specific view; and Jacobian R1 penalises the full input-logit Jacobian, overcoming pooled R1's neglect of most logit sensitivities. In one step, ROAD reaches 11.03 FID on SDXL and 13.73 on SD3.5-M on COCO-10K, surpassing the multi-step teachers at a fraction of distribution matching's training compute.
Read the story and explore more from the AspireAI community.
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.