mlsanityData to 7 Oct 2026

Read As Human: Compressing Context via Parallelizable Close Reading and Skimming

arXiv 2602.01840 ↗First posted 2 Feb 2026cs.CLcited by 10

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) demonstrate exceptional capability across diverse tasks. However, their deployment in long-context scenarios is hindered by two challenges: computational inefficiency and redundant information. We propose RAM (Read As HuMan), a context compression framework that adopts an adaptive hybrid reading strategy, to address these challenges. Inspired by human reading behavior (i.e., close reading important content while skimming less relevant content), RAM partitions the context into segments and encodes them with the input query in parallel. High-relevance segments are fully retained (close reading), while low-relevance ones are query-guided compressed into compact summary vectors (skimming). Both explicit textual segments and implicit summary vectors are concatenated and fed into decoder to achieve both superior performance and natural language format interpretability. To refine the decision boundary between close reading and skimming, we further introduce a contrastive learning objective based on positive and negative query-segment pairs. Experiments demonstrate that RAM outperforms existing baselines on multiple question answering and summarization benchmarks across two backbones, while delivering up to a 12x end-to-end speedup on long inputs (average length 16K; maximum length 32K).

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 30 of its 47 references that are in the map. First posted on arXiv 2 Feb 2026.

Builds on

30 of 47 references.

References · 30

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  4. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
  5. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
  6. 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,259
  7. 2017The NarrativeQA Reading Comprehension Challengecited by 590
  8. 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compressioncited by 443
  9. 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
  10. 2023Learning to Compress Prompts with Gist Tokenscited by 379
  11. 2023Adapting Language Models to Compress Contextscited by 350
  12. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 343
18 more
  1. 2024xRAG: Extreme Context Compression for Retrieval-augmented Generation with One Tokencited by 123
  2. 2024Long Context Compression with Activation Beaconcited by 101
  3. 2024CompAct: Compressing Retrieved Documents Actively for Question Answeringcited by 64
  4. 2024Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inferencecited by 51
  5. 2024Context Embeddings for Efficient Answer Generation in RAGcited by 26
  6. 2024Retaining Key Information under High Compression Ratios: Query-Guided Compressor for LLMscited by 24
  7. 2025MathSmith: Towards Extremely Hard Mathematical Reasoning by Forging Synthetic Problems with a Reinforced Policycited by 24
  8. 2024Perception Compressor: A Training-Free Prompt Compression Framework in Long Context Scenarioscited by 22
  9. 2025DAST: Context-Aware Compression in LLMs via Dynamic Allocation of Soft Tokenscited by 21
  10. 2025GMSA: Enhancing Context Compression via Group Merging and Layer Semantic Alignmentcited by 20
  11. 2025Autoencoding-Free Context Compression for LLMs via Contextual Semantic Anchorscited by 14
  12. 2024Forgetting Curve: A Reliable Method for Evaluating Memorization Capability for Long-context Modelscited by 13
  13. 2025Long Context In-Context Compression by Getting to the Gist of Gistingcited by 12
  14. 2025UQABench: Evaluating User Embedding for Prompting LLMs in Personalized Question Answeringcited by 9
  15. 2025UniGist: Towards General and Hardware-aligned Sequence-level Long Context Compressioncited by 8
  16. 2025Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retentioncited by 7
  17. 2025LexSemBridge: Fine-Grained Dense Representation Enhancement through Token-Aware Embedding Augmentationcited by 5
  18. 2025CoS: Towards Optimal Event Scheduling via Chain-of-Schedulingcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 10.

10 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025No Mean Feat: Simple, Strong Baselines for Context Compression
  2. 2026EnComp: Lightweight Encoder-Only Context Compression for Retrieval-Augmented Question Answering
  3. 2026COMI: Coarse-to-fine Context Compression via Marginal Information Gain
  4. 2024Recurrent Context Compression: Efficiently Expanding the Context Window of LLM
  5. 2026SeDeM: Selective Decompression of Hidden-State Memories for Long-Context Question Answering
  6. 2026Context Compression Is Not One Thing: Readable Symbolic Re-expression vs. Coherent Summary at Matched Budget
  7. 2024Adapting LLMs for Efficient Context Processing through Soft Prompt Compression
  8. 2026PoC: Performance-oriented Context Compression for Large Language Models via Performance Prediction