One shared memory pool for weights, KV cache and expert pages reached up to 19.03 times the throughput of offloading baselines on a single RTX 5090
AspireAI community · arXiv
Serving systems normally provision separate memory for model weights and attention states, so idle memory in one region cannot be reused by the other, and modern mixture-of-experts models add tensors with different layouts and lifetimes. This system unifies management through a shared page pool, per-tensor memory views that let each tensor interpret that space with its own page size and page table, and a page-table-aware fused MoE kernel that reads non-contiguous expert weights without copying them. On a single RTX 5090 and two RTX 4090D GPUs serving Qwen3-30B and Qwen3.5-35B, it reached up to 1.39 to 19.03 times the throughput of baselines and cut time to first token by up to 99 percent, and up to 11.34 times the throughput of Fate and 12.7 times that of llama.cpp. The honest caveat is that it can show higher time to first token in some cases, buying that back through higher concurrency.
Read the story and explore more from the AspireAI community.
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.