The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The paper investigates how to inject knowledge into addressed memory modules of language models. Using controlled experiments on GPT‑2 and production‑memory tests on Qwen3.8‑Flash‑Next‑FP8 and DeepSeek‑V4.1‑Flash, the authors compare row‑only and row‑plus‑projection updates, with and without fixed module‑residual anchoring. Results show that while anchoring reduces drift, lexical hits do not guarantee entity‑specific retrieval, and first‑token rankings alone do not ensure full answer success, indicating that writable memory is feasible but limited in scope.
arXiv:2603. 06642v2 Announce Type: replace-cross Abstract: Test-Time Training (TTT) language models replace the KV-cache with fast weights updated during inference, achieving O(1) memory but suffering catastrophic failure on exact-recall tasks.
arXiv:2606. 28876v2 Announce Type: replace-cross Abstract: We study memory-managed long-context attention: explicit bounded memory with a learned query-independent writer, lifecycle control, query-aware reading, calibrated sparse fallback, and frozen-LLM generation from raw evidence.
arXiv:2606. 28876v1 Announce Type: cross Abstract: Long-context language models often conflate two different goals: compressing history into an efficient state, and maintaining reliable long-term memory.
arXiv:2609.25853v1 Announce Type: new Abstract: Learned-memory methods store information in an explicit table and consume it through a separate reader, allowing addressing, storage, and reading to be...
The paper introduces MERIT, a benchmark that evaluates the marginal benefit of long‑term memory for tool‑using large language model agents while explicitly accounting for cost. MERIT provides episodic tool‑use tasks across three domains, verifies dependence on earlier‑episode facts, and measures memory operations in tokens and dollars. Experiments on GPT‑4.1‑mini, Claude Haiku 4.5, and Claude Sonnet 5 show that memory can significantly improve task success, but its utility varies widely across models and memory implementations, and full replay is rarely cost‑effective.