aspireai.
PUBLIC EDITION

GateRQ cut GPU memory for DeepSeek-V4.1-Flash's conditional memory tables 7.8x by ranking lookups by the gate instead of access frequency

AspireAI community · arXiv (Chinese Academy of Sciences, Tencent)
*Conditional memory layers such as DeepSeek's Engram attach large hashed n-gram tables to a language model, and removing them from DeepSeek-V4.1-Flash costs 36.8 PopQA points.* Low-bit quantization loses long-tail facts first, and the standard remedy - giving more bits to frequently accessed rows - backfires: refining lookups by access frequency is worse than refining them at random. The authors trace this to the gate that scales each retrieved row, whose weight is small for frequent n-grams, large for the rare n-grams of long-tail entities, and computable from a 1-bit code. GateRQ stores each row as a ladder of 1-bit residual codes, keeps level 1 in GPU memory to compute the gate, and reads deeper levels only for the lookups the gate ranks highest. Without retraining, it cuts GPU table memory by 7.8x on DeepSeek-V4.1-Flash and raises vLLM throughput by 11 to 31 percent over FP8 tables, losing about 1 PopQA point at 1.50 bits read per lookup and 0.2 points at 2.10 bits across two models.
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.