aspireai.
PUBLIC EDITION

SVD compression of LLMs got better at two things at once, with up to 4.8 points of zero-shot accuracy back

AspireAI community · arXiv (ICML 2026)
Low-rank SVD compression is one of the standard ways to shrink an LLM, but it has two well-known weaknesses: rank is allocated globally using error proxies that do not track how error actually propagates between layers, and Fisher-based estimators for the decomposition suffer severe rank collapse. LEMS attacks the first with a layer-wise error surrogate that mixes local and global layer importance with a propagation bias, turning rank allocation into an integer program. KFAC-SVD attacks the second by using token-wise statistics instead. Tested on the Mistral, Qwen3 and Llama 3 families, the combination consistently beat existing search strategies, delivering zero-shot accuracy gains of up to 4.8 percentage points that still held at 70B parameter scale, while KFAC-SVD alone improved perplexity by an average of 15%. The practical caveat is that both gains are reported on the mistral-family and Qwen-family checkpoints rather than a wide sweep of architectures, so the ranking against other compression methods is worth re-checking on your own model.
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.