FlashMem: Distilling Intrinsic Latent Memory via Computation Reuse
Not on the map. Why?
Abstract (arXiv)
The stateless architecture of Large Language Models inherently lacks the mechanism to preserve dynamic context, compelling agents to redundantly reprocess history to maintain long-horizon autonomy. While latent memory offers a solution, current approaches are hindered by architectural segregation, relying on auxiliary encoders that decouple memory from the reasoning backbone. We propose FlashMem, a framework that distills intrinsic memory directly from transient reasoning states via computation reuse. Leveraging the property that internal representations uniquely encode input trajectories, FlashMem identifies the last hidden state as a sufficient statistic for the interaction history. This enables a Shared-KV Consolidator to synthesize memory by attending directly to the backbone's frozen cache, eliminating redundant re-parameterization. Furthermore, a parameter-free Cognitive Monitor leverages attention entropy to adaptively trigger consolidation only when high epistemic uncertainty is detected. Experiments demonstrate that FlashMem matches the performance of heavy baselines while reducing inference latency by 5 times, effectively bridging the gap between efficiency and persistent cognition.
Key facts. Cited by 7 papers in the map (data through 13 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 9 Jan 2026.
Builds on
28 of 42 references.
References · 28
- 2021Training Verifiers to Solve Math Word Problemscited by 9,916
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,221
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,270
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,348
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,804
- 2022Locating and Editing Factual Associations in GPTcited by 2,650
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,137
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,835
- 2023MemGPT: Towards LLMs as Operating Systemscited by 1,354
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,323
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,302
- 2021Improving language models by retrieving from trillions of tokenscited by 1,286
16 more
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,049
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 856
- 2022Teaching Models to Express Their Uncertainty in Wordscited by 740
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funnelingcited by 422
- 2023Learning to Compress Prompts with Gist Tokenscited by 382
- 2024LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitaskscited by 369
- 2021Efficient Attentions for Long Document Summarizationcited by 342
- 2025Memory in the Age of AI Agentscited by 291
- 2021BookSum: A Collection of Datasets for Long-form Narrative Summarizationcited by 184
- 2025Memento: Fine-tuning LLM Agents without Fine-tuning LLMscited by 126
- 2025KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Codingcited by 115
- 2025SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMscited by 111
- 2025MemGen: Weaving Generative Latent Memory for Self-Evolving Agentscited by 103
- 2025Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Spacecited by 42
- 2025Language Models are Injective and Hence Invertiblecited by 34
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026RealMem: Benchmarking LLMs in Real-World Memory-Driven Interactioncited by 20
- 2026Toward Efficient Agents: Memory, Tool learning, and Planningcited by 14
- 2026Latent On-Policy Self-Distillationcited by 7
- 2026Mem-W: Latent Memory-Native GUI Agentscited by 3
- 2026Continual Self-Improvement with Lightweight Experiential Latent Memoriescited by 1
- 2026PolarMem: A Training-Free Polarized Latent Graph Memory for Verifiable Vision-Language Modelscited by 0
- 2026MaSRead: Content-Addressed Reading of Replicated Latent Storescited by 0
- 2026Latent On-Policy Self-Distillation13 Aug 2026
- 2026MaSRead: Content-Addressed Reading of Replicated Latent Stores21 Jul 2026
- 2026Continual Self-Improvement with Lightweight Experiential Latent Memories16 Jun 2026
- 2026Mem-W: Latent Memory-Native GUI Agents10 May 2026
- 2026PolarMem: A Training-Free Polarized Latent Graph Memory for Verifiable Vision-Language Models31 Jan 2026
- 2026Toward Efficient Agents: Memory, Tool learning, and Planning20 Jan 2026
- 2026RealMem: Benchmarking LLMs in Real-World Memory-Driven Interaction11 Jan 2026