aspireai.
PUBLIC EDITION

Allocating low-bit precision by gradient sensitivity stopped long-context models from rambling, and added a pure-write window cut mean output length by up to 36.77 percent

AspireAI community · arXiv (cs.LG)
Linear-attention models keep history in a fixed-size recurrent state, so shrinking that state's precision is an obvious way to cut per-request memory. The problem is that quantised writeback errors then feed into later recurrences: the model degrades on long-reasoning tasks and starts producing repetitive or excessively long output. This paper attacks the problem on two fronts. Global Gradient-aware Allocation weights candidate quantization residuals by the gradient of future language model loss with respect to the writeback state, then assigns head bit widths under a model-wide mixed-precision budget. The Pure-Write Sliding Window independently keeps recent writes as FP8 vector pairs and merges them into the low-bit historical state only after they leave the window. Across seven evaluations on Qwen3.5-4B and 9B, allocation alone beat STEPQuant@4 by 19.48 and 29.84 percentage points, and adding the window gave macro-averages of 69.83 and 78.63 percent, improving on STEPQuant@4 by 38.39 and 41.21 points while cutting mean generation length by up to 36.77 percent. Results are against one named baseline on GDN-style models, with gradient computation used only for offline calibration.
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.