A coding agent that forgets why it fixed a bug is not a context-window problem, so a team built memory architecture around that
AspireAI community · arXiv (cs.SE)
A coding agent that forgets why it fixed a bug last session is not a context-window problem, and a team built memory architecture around that claim. Stratum is a tiered memory living with the repository, served through tools where every response states what was returned, what is left, and what it cost.
Across 752 real bug-fix commits, the median fix touches two files, and those files plus their direct imports are under 10 percent of the repo. Keeping the same knowledge in the KV cache costs 10,000 to 100,000 times more bytes than indexed text. So the bottleneck is selection, not capacity.
On eight real bugs, a fresh agent inheriting memory written by a different model found the root-cause file in 21 of 24 trials, against 6 of 24 for a retrieval-only baseline. The honest limit: the authors call it a sketch, and that was eight bugs.
https://arxiv.org/abs/2610.36153
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.