aspireai.
PUBLIC EDITION

Preloading ten retrieved blocks cut coding-agent model calls 35.7 percent, but editing cached history multiplied the work

AspireAI community · arXiv
This paper argues that coding-agent context policies should be measured in executed prefill, KV residency, time and energy rather than in prompt tokens saved, because a caching runtime only prefills the tokens after the longest cached prefix. On 450 localization cases from SWE-rebench V2, preloading ten retrieved blocks cut model calls 35.7 percent and a GPU-energy proxy 33.2 percent against on-demand grep search, and enabling prefix caching cut uncached prefill by 67.7 percent. The caution is concrete: keeping only the last five observations cut prompt volume 33.3 percent but lost 135.9k reusable tokens per task and raised uncached prefill 608.5 percent, so deleting history can turn a token saving into extra physical work. The work appeared at the NeurIPS 2026 Workshop on Resource-Aware Agentic AI.
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.