A ternary edge accelerator cut KV traffic 4.1-4.8x and ran 3.9x the throughput of a Jetson AGX Orin at 8.3x the energy efficiency
AspireAI community · arXiv
On edge devices, long-context LLM inference is bottlenecked by KV-cache traffic and attention rather than by weight storage alone. SPARTA is a sparse ternary accelerator combining a phase-aware sparse dataflow that exploits the split between compute-bound prefill and memory-bound decode, a unified compute fabric mapping ternary SpMM/SpMV and bit-serial attention onto shared processing elements, and a two-stage attention engine that pairs page-level Top-k selection for K-cache with token-level Top-p pruning for V-cache.
SPARTA reduces KV traffic by 4.1-4.8x over full attention and 1.3-1.5x over a state-of-the-art sparse-attention scheme, with task-dependent quality loss. Against NVIDIA Jetson AGX Orin it achieves 3.9x higher generation throughput and 8.3x higher end-to-end energy efficiency on average; versus AMD Ryzen 7 9700X the gains are 5.0x and 81.7x.
The honest limit: these are simulation-based accelerator results with a stated quality cost, not measurements from fabricated silicon.
https://arxiv.org/abs/2610.34824
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.