mlsanityData to 14 Oct 2026

Evaluating Compressed Memory: Dependence, Utility, and Content Benefit

arXiv 2610.19373 ↗First posted 14 Oct 2026cs.CL cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Does a language model answer better because its compressed memory contains useful document information? Replacing memory vectors with zeros can lower a trained model's score without showing that it outperforms a model trained without memory. We combine zeroing with separately trained models that cannot access stored text or receive the same constant input for every document. Across nine systems, some models rely on memory yet perform worse than the trained alternative. For example, in experiments that predict states in generated stories, zeroing memory worsens a model's prediction loss, yet a model trained without memory achieves lower loss than the original model with intact memory. On TriviaQA, giving xRAG memory from another question's passage raises F1, which measures word overlap with accepted answers, from 19.38 without a document to 24.78. Its effect on how often outputs contain an accepted answer is statistically uncertain. The question's retrieved passage scores higher still (29.88 F1). Thus a gain over no document alone does not establish that the gain requires the question's passage. Evaluations must therefore specify the comparison model, absolute performance, and generation and scoring conditions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 30 of its 42 references that are in the map. First posted on arXiv 14 Oct 2026.

Builds on

30 of 42 references.

References · 30

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  4. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  5. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  6. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  7. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
  8. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  9. 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
  10. 2019Compressive Transformers for Long-Range Sequence Modellingcited by 726
  11. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 695
  12. 2018CoQA: A Conversational Question Answering Challengecited by 683
18 more
  1. 2019Designing and Interpreting Probes with Control Taskscited by 640
  2. 2021A Dataset of Information-Seeking Questions and Answers Anchored in Research Paperscited by 486
  3. 2018A Benchmark for Interpretability Methods in Deep Neural Networkscited by 476
  4. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
  5. 2023Learning to Compress Prompts with Gist Tokenscited by 390
  6. 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 359
  7. 2024The Power of Noise: Redefining Retrieval for RAG Systemscited by 281
  8. 2024xRAG: Extreme Context Compression for Retrieval-augmented Generation with One Tokencited by 125
  9. 2024Long Context Compression with Activation Beaconcited by 104
  10. 2021Conditional probing: measuring usable information beyond a baselinecited by 62
  11. 2021What Context Features Can Transformer Language Models Use?cited by 50
  12. 2023Compressed Context Memory For Online Language Model Interactioncited by 43
  13. 2025Cramming 1568 Tokens into a Single Vector and Back Again: Exploring the Limits of Embedding Space Capacitycited by 28
  14. 2024LoCoCo: Dropping In Convolutions for Long Context Compressioncited by 19
  15. 2024A Silver Bullet or a Compromise for Full Attention? A Comprehensive Study of Gist Token-based Context Compressioncited by 17
  16. 2025Understanding and Improving Information Preservation in Prompt Compression for LLMscited by 15
  17. 2025No Mean Feat: Simple, Strong Baselines for Context Compressioncited by 7
  18. 2026Detecting Overflow in Compressed Token Representations for Retrieval-Augmented Generationcited by 1

Built on by

Not cited yet.