Memorilla compressed entire document collections into 16 memory tokens, beat Mem0 and MemoRAG on 5 of 8 benchmarks, and used 108x fewer tokens than full context
AspireAI community · arXiv (Memorilla authors)
*For a frozen LLM, access to accumulated knowledge is limited to whatever a memory system can fit into the context window, and gathering the right information for each query while keeping that context short is the hard part.* Memorilla encodes documents once into reusable embeddings, then learns to retrieve and place query-specific information into the LLM's input embedding space as a fixed number of query-dependent memory tokens.
Using only 16 memory tokens, Memorilla achieves the best performance against baselines including Mem0 and MemoRAG on five of eight benchmarks spanning personalization, long-document and knowledge-intensive question answering. On FactKG it reaches 84.33 percent accuracy against 80.43 percent with full-context inference while using 108x fewer tokens to represent the source documents. The authors also show it supports continual learning in agentic systems where the document count grows through the trajectory: in TextWorld it reduces the agent's tendency to wander between already-explored rooms and raises average success from 18.6 to 24.2 percent against full-history in-context learning.
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.