paper-with-me

홈 › Papers

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

2026-02-02 · Jiwei Tang, Shilei Liu, Zhicheng Zhang, Qingsong Lv, Runsong Zhao, Tingwei Lu, Langming Liu, Haibin Chen, Yujin Yuan, Hai-Tao Zheng, Wenbo Su, Bo Zheng 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).

📄 PDF Abstract BibTeX arXiv:2602.01840

Code (0)

등록된 구현이 없습니다.

Tasks

Contrastive LearningQuestion Answering

Similar Papers 제목 키워드 기반

On the Effectiveness of Low-Rank Matrix Factorization for LSTM Model Compression

2019-08-27 · Genta Indra Winata, Andrea Madotto, Jamin Shin, Elham J. Barezi 외

Despite their ubiquity in NLP tasks, Long Short-Term Memory (LSTM) networks suffer from computational inefficiencies caused by inherent unparallelizable recurrences, which further aggravates as LSTMs require more paramet…

Model Compression

Compressing Images by Encoding Their Latent Representations with Relative Entropy Coding

2020-10-02 · NeurIPS 2020 12 · Gergely Flamich, Marton Havasi, José Miguel Hernández-Lobato

Variational Autoencoders (VAEs) have seen widespread use in learned image compression. They are used to learn expressive latent representations on which downstream compression methods can operate with high efficiency. Re…

Image Compression

From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression

2024-10-05 · Eunseong Choi, Sunkyung Lee, Minjin Choi, June Park 외

Large language models (LLMs) have achieved significant performance gains using advanced prompting techniques over various tasks. However, the increasing length of prompts leads to high computational costs and often obscu…

Decoder

APWA: A Distributed Architecture for Parallelizable Agentic Workflows

2026-05-14 · Evan Rose, Tushin Mallick, Matthew D. Laws, Cristina Nita-Rotaru 외 arxiv

Autonomous multi-agent systems based on large language models (LLMs) have demonstrated remarkable abilities in independently solving complex tasks in a wide breadth of application domains. However, these systems hit crit…

Implicit Sensitive Text Summarization based on Data Conveyed by Connectives

2013-12-11 · Henda Chorfi Ouertani

So far and trying to reach human capabilities, research in automatic summarization has been based on hypothesis that are both enabling and limiting. Some of these limitations are: how to take into account and reflect (in…

Text SummarizationWorld Knowledge