paper-with-me

홈 › Papers

Recurrent Context Compression: Efficiently Expanding the Context Window of LLM

2024-06-10 · Chensen Huang, Guibo Zhu, Xuepeng Wang, Yifei Luo, Guojing Ge, Haoran Chen, Dong Yi, Jinqiao Wang

To extend the context length of Transformer-based large language models (LLMs) and improve comprehension capabilities, we often face limitations due to computational resources and bounded memory storage capacity. This work introduces a method called Recurrent Context Compression (RCC), designed to efficiently expand the context window length of LLMs within constrained storage space. We also investigate the issue of poor model responses when both instructions and context are compressed in downstream tasks, and propose an instruction reconstruction method to mitigate this problem. We validated the effectiveness of our approach on multiple tasks, achieving a compression rate of up to 32x on text reconstruction tasks with a BLEU4 score close to 0.95, and nearly 100\% accuracy on a passkey retrieval task with a sequence length of 1M. Finally, our method demonstrated competitive performance in long-text question-answering tasks compared to non-compressed methods, while significantly saving storage resources in long-text inference tasks. Our code, models, and demo are available at https://github.com/WUHU-G/RCC_Transformer

📄 PDF Abstract BibTeX arXiv:2406.06110

Code (1)

WUHU-G/RCC_Transformer 공식 구현 pytorch

Tasks

Long-Context UnderstandingQuestion AnsweringRetrievalText Compression

Similar Papers 제목 키워드 기반

LCIRC: A Recurrent Compression Approach for Efficient Long-form Context and Query Dependent Modeling in LLMs

2025-02-10 · Sumin An, Junyoung Sung, Wonpyo Park, Chanjun Park 외

While large language models (LLMs) excel in generating coherent and contextually rich outputs, their capacity to efficiently handle long-form contexts is limited by fixed-length position embeddings. Additionally, the com…

Form

MELODI: Exploring Memory Compression for Long Contexts

2024-10-04 · Yinpeng Chen, DeLesley Hutchins, Aren Jansen, Andrey Zhmoginov 외

We present MELODI, a novel memory architecture designed to efficiently process long documents using short context windows. The key principle behind MELODI is to represent short-term and long-term memory as a hierarchical…

Dynamic Compression in Recurrent Networks

2026-08-18 · Jyothish Pari, Ryan Bahlous-Boldi, Pulkit Agrawal arxiv

Recurrent models process long contexts efficiently by compressing their history into a fixed-size state, but modern architectures typically do so in a single causal pass over the sequence. Each input must therefore be co…

Video Detective: Seek Critical Clues Recurrently to Answer Question from Long Videos

2025-12-19 · Henghui Du, Chunjie Zhang, Xi Chen, Chang Zhou 외 arxiv

Long Video Question-Answering (LVQA) presents a significant challenge for Multi-modal Large Language Models (MLLMs) due to immense context and overloaded information, which could also lead to prohibitive memory consumpti…

Fostering Event Compression using Gated Surprise

2020-05-12 · Dania Humaidan, Sebastian Otte, Martin V. Butz

Our brain receives a dynamically changing stream of sensorimotor data. Yet, we perceive a rather organized world, which we segment into and perceive as events. Computational theories of cognitive science on event-predict…

Model-based Reinforcement Learning