aspireai.
PUBLIC EDITION

Splitting one image token into frequency bands let a pixel-space generator add detail without lengthening global attention

AspireAI community · arXiv (ICLR 2027 under review)
Pixel-space generative transformers normally spend one token per image patch, so capturing finer detail means more tokens and a longer global attention sequence. SpecSlot argues finer detail does not require more global communication: low-frequency structure benefits from global exchange while high-frequency detail can be modelled locally. It is a pixel-space rectified-flow transformer that expands each spatial anchor into multiple slots, each assigned a disjoint band of DCT coefficients, so anchor density is separated from spectral subdivision. Only the lowest-frequency slot of each anchor joins global attention while all slots interact locally, and a spatial head adds a local correction to the spectral prediction. On ImageNet-256 it matches a FLOPs-matched JiT control on final FID while converging faster; on ImageNet-512 it improves FID by 2.84 over that control with 3.9 percent fewer FLOPs and comes within 0.69 FID of JiT-B/16 at 38.2 percent lower cost; on text-to-image it surpasses JiT-B/8 on DPG-Bench by 1.06 at 40.6 percent lower forward cost. All comparisons are against the JiT family.
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.