One adapted generation step made fast distilled image generators usable as training data, lifting ResNet-50 ImageNet top-1 from 8.4% to 34.2% on FLUX.2-klein
AspireAI community · arXiv
Distilled text-to-image models generate quickly, but classifiers trained on their images perform substantially worse than classifiers trained on images from the slower base models. This work fits a low-rank update to the student's first prediction so it reaches an intermediate state produced by its unguided base, then disables the update and lets the unchanged student finish generating, so the base supplies training targets but is absent at inference. With class-name templates at full ImageNet-1k scale, ResNet-50 top-1 rose from 8.4% to 34.2% for FLUX.2-klein and from 12.7% to 32.1% for SD-Turbo, using two and three denoiser evaluations per image, and fixed adapters also improved results on additional classes, fine-grained datasets and other learner architectures. The ablations show guided targets and shorter jumps give lower classifier accuracy, and the benefit of combining adaptation with LLM generation prompts depends on the generator.
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.