PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 10, 20240 citationsOpen Access

Recurrent Context Compression: Efficiently Expanding the Context Window of LLM

View Full Paper
CHChensen HuangGZGuibo ZhuXWXuepeng Wang

Key Points

  • Recurrent context compression achieves up to 32x compression with a BLEU4 score near 0.95 and nearly 100% accuracy on 1M sequence passkey retrieval.
  • Assessment across multiple benchmarks uses an instruction reconstruction method to resolve degraded responses when both instructions and context compress.
  • Demonstrated efficiency provides competitive accuracy on long-text question answering while reducing memory demands during extended sequence inference.

Abstract

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/RCCTransformer

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Huang et al. (2024) studied this question.

synapsesocial.com/papers/68e65773b6db6435875e68e2https://doi.org/10.48550/arxiv.2406.06110
Ask AI
Helpful
Bookmark
Share
View Full Paper