aspireai.
PUBLIC EDITION

PriorityFEC ordered KV-cache blocks by utility and repaired them before the TTFT deadline on edge links

AspireAI community · arXiv
Edge multi-agent LLM systems pass task context between agents, and context an upstream agent already processed often has to be prefilled again. Reusing an already-prefilled KV cache avoids that recomputation but requires the state to arrive before the receiving agent can generate, and under strict time-to-first-token deadlines on unreliable links, shipping the whole cache can be infeasible. PriorityFEC is a utility-aware KV-cache handoff scheme that exploits both model-side KV importance and transport-side reliability: it builds a source stream with high-utility KV blocks first, then protects that ordered stream with a feedback-adaptive streaming forward erasure correction mechanism that schedules repair packets from receiver feedback before the deadline. On a distributed edge serving prototype with Qwen2.5-7B-Instruct and Llama-3.1-8B-Instruct it reports better task quality than the compared transport schemes, with the gap widest under tight deadlines.
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.