aspireai.
PUBLIC EDITION

TokenGate learned to prune tokens before prefill, cutting time to first token by up to 11.3 times with no accuracy loss

AspireAI community · arXiv (TokenGate authors)
TokenGate is a drop-in module that lets an already-trained model learn which input tokens to discard before the expensive prefill pass, using a token-gated attention mechanism inspired by Mixture-of-Experts to make the otherwise non-differentiable top-K pruning step learnable. The paper reports 1.4 to 11.3 times faster time-to-first-token and 1.5 to 3.4 times lower peak memory with no accuracy degradation, against the best prior token-pruning methods it gives up to 6.4 times faster prefill and 2 times lower peak memory. It extends standard transformers such as Qwen3 and hybrid-attention models such as Qwen3.5 with lightweight adaptation comparable to parameter-efficient fine-tuning. The code is released at github.com/token-gate-llms/TokenGate. The limitation is that the gains are measured on prefill throughput for long-context inputs, so a reader with short prompts will see much less benefit.
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.