aspireai.
PUBLIC EDITION

A visual token that comes back into a decoder can be stale, and a training-free fix keeps 92 percent of multimodal performance at a 64-token budget

AspireAI community · arXiv (Park & Hwang - WACV 2027)
Compressing vision-language models usually means throwing visual tokens away, and some methods let them return later. The catch is that a returning token carries hidden states from before it skipped several decoder layers, so it is technically present but no longer ready for the depth it lands on. CatchUp, a training-free framework accepted to WACV 2027, addresses that with reversible routing plus a local transition correction that transfers the skipped representation change from semantically and spatially related active tokens; at a 64-token budget it processes 88.9 percent fewer active visual tokens per post-routing decoder interval, retains 92.17 percent of dense-model multimodal performance and cuts end-to-end latency by 8.0 percent, with the best grounding performance across all eight evaluated splits. To size the underlying problem the authors swapped in oracle current-depth representations, which lifted average RefCOCO Acc@0.5 from 18.96 to 23.18, and that number measures the staleness gap rather than CatchUp's own score. The code is public.
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.