Running a 70B-parameter model on a single consumer GPU is mostly a memory and engineering problem, so the authors treated it as a budget-aware design problem over device memory, long-context throughput and integration cost, then ran controlled ablations on how pruning, weight quantization and KV-cache compression interact. Layer-wise pruning made weight quantization more robust, KV-cache sparsification complemented INT8 KV quantization without hurting decode speed, and static vector quantizers conflicted with dynamic caching. The assembled pipeline compressed a 70B model to roughly 33 GB, sustained about 57 tokens per second on 10k-token prompts on a single A40, and kept absolute accuracy within 5 percent on common and reasoning benchmarks, with design rules and a reproducible protocol that reports quality, memory and end-to-end speed together. The limitation: the pipeline is hand-assembled rather than searched automatically, the headline configuration is one model on one GPU, and the accuracy figure is an absolute ceiling rather than a like-for-like comparison against an uncompressed baseline.
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.