aspireai.
PUBLIC EDITION

MoEZip: KV-cache compression built around the fact that evicting tokens can change which experts fire

AspireAI community · arXiv (NeurIPS 2026)
KV-cache compression methods built for dense transformers ignore a problem specific to sparse Mixture-of-Experts models: evicting cached context can change which experts get selected during generation, which quietly degrades output quality. MoEZip scores cache entries by combining a new metric, built on the Fisher information matrix of routing distributions, with attention weights, so that routing sensitivity drives what survives eviction. It also composes that with complementary eviction strategies for dense and sparse architectures. At a 10% KV retention ratio, the paper reports improvement over the prior state-of-the-art baseline of +24 points on LongBench and +20 on RULER, corresponding to 2.3x and 4.9x higher scores. The gains are as reported by the authors at NeurIPS 2026 and have not been independently reproduced here.
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.