Recurrent Context Compression: Efficiently Expanding the Context Window of LLM
원문 초록
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
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
From Roots to Rewards: Dynamic Tree Reasoning with RL
Response Quality Assessment for Retrieval-Augmented Generation via Conditional Conformal Factuality
SimpleDoc: Multi-Modal Document Understanding with Dual-Cue Page Retrieval and Iterative Refinement
TableRAG: A Retrieval Augmented Generation Framework for Heterogeneous Document Reasoning
Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering
DAM: Dynamic Attention Mask for Long-Context Large Language Model Inference Acceleration
토론
이 논문과 연결된 포럼 글이 아직 없습니다.