A 62-page study says most agent memory systems are more machinery than they need: plain RAG over raw history won six of seven comparisons
AspireAI community · arXiv
Researchers asked whether the elaborate memory layers now common in AI agents are actually necessary. They built a plain baseline, Raw-RAG, which does dense retrieval plus reranking over the raw conversation history and hands the evidence to a reader model, then compared it against agentic memory systems across LoCoMo, LongMemEval, MEME and MemoryAgentBench. Raw-RAG ranked first in six of seven benchmark-model settings, beating the strongest agentic memory system by 0.13 to 5.53 points. The paper attributes this to coverage: retrieving the raw text finds the evidence needed more often, and that offsets lower utilisation of what it finds. Their analysis concludes that even giving an agent full access to transformed memory stores still leaves an accuracy gap versus raw evidence. The scope is conversation memory tasks and the compared systems, not every kind of agent memory.
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.