MeMo: Memory as a Model — Forging a Second Brain Instead of Stuffing Context
Paper: MeMo: Memory as a Model (arXiv: 2605.15156) Authors: Ryan Wei Heng Quek, Sanghyuk Lee, Alfred Wei Lun Leong, Arun Verma, Alok Prakash, Nancy F. Chen, Bryan Kian Hsiang Low, Daniela Rus, Armando Solar-Lezama Institutions: National University of Singapore, MIT CSAIL, A*STAR, University of Tokyo, AI Singapore, SMART Categories: cs.CL, cs.AI, cs.LG
Key points
- Core idea: Rather than modifying a frozen LLM, MeMo attaches a separately trained Memory Model that has internalized a corpus as parameterized knowledge, paired with the main LLM (the Executive Model) via a black-box, natural-language interface.
- Non-parametric (ICL, RAG): context windows saturate; costs grow with corpus size; RAG is sensitive to retrieval noise and struggles with multi-document synthesis.
- Parametric (continual pre-training, SFT): expensive, risks catastrophic forgetting, can erode safety alignment (Qi et al., 2024), and is impossible for closed models.
- Latent-memory methods (AutoCompressor, Gist Tokens, ICAE): compressed representations are bound to the encoder model and not transferable across LLMs.
- MeMo is claimed to be the only method that simultaneously keeps the base LLM frozen, needs no retrieval index, supports black-box LLMs, avoids catastrophic forgetting, keeps memory size constant, and transfers across LLMs.
- MeMo leads on NarrativeQA and MuSiQue; matches or beats HippoRAG2 on BrowseComp-Plus with Gemini-3-Flash.
- Noise robustness: with distractor documents added, NV-Embed-V2 and HippoRAG2 dropped ~6 points on BrowseComp-Plus while MeMo improved by 0.55 points; on MuSiQue MeMo dropped only 1.77 points.
- Ablations: larger Memory Models help (task-dependent); performance is insensitive to Memory Model architecture (Qwen2.5 vs Gemma3 vs LFM2.5 at ~1–2B).
- Decoupling: knowledge storage and reasoning evolve independently; domain-specific Memory Models can be swapped in at inference.
- Distillation: the pipeline converts raw text into higher-order, structured Reflection QA knowledge.
- Resilience: robustness to noise, architecture-agnostic memory, and cheap continual updates suit messy real-world corpora.
Limitations of existing approaches
Five-step Reflection QA synthesis pipeline
1. Fact extraction: direct and indirect QA pairs per chunk. 2. Consolidation: merge related QA pairs into compositional ones. 3. Verification & rewriting: enforce self-contained questions/answers (resolve pronouns, implicit references); discard failures. 4. Entity surfacing: descriptions point to entities, combating the Reversal Curse. 5. Cross-document synthesis: converging clues and parallel properties across related documents.
Training
The Memory Model (14B, smaller than the 32B Executive Model) is fine-tuned on the QA sets while never seeing the source documents, forcing genuine internalization:
Continual integration via model merging
Task vectors \(\tau_i = \varphi_i - \varphi_0\) from separate corpora are merged (14 configurations tested; TIES with density ρ=0.3 worked best on NarrativeQA) — far cheaper than retraining.
Three-phase inference protocol
1. Grounding: the Executive Model decomposes the query into atomic sub-questions. 2. Entity identification: iterative narrowing to a single entity e*. 3. Answer seeking & synthesis: gather supporting facts, then synthesize the final answer. All exchanges are compact natural-language snippets, so query cost is constant regardless of corpus size; no access to weights, gradients, or logits is required.
Results
| Method | BrowseComp-Plus (Gemini-3-Flash) | NarrativeQA (Gemini-3-Flash) | MuSiQue (Gemini-3-Flash) | |---|---|---|---| | Perfect Retrieval (upper bound) | 88.33 | 60.41 | 73.00 | | BM25 | 27.00 | 14.33 | 23.20 | | NV-Embed-V2 | 57.00 | 26.62 | 46.60 | | HippoRAG2 | 66.33 | 23.21 | 57.00 | | MeMo | 66.67 | 53.58 | 60.20 |