Pith. sign in

REVIEW 2 cited by

Recurrent Context Compression: Efficiently Expanding the Context Window of LLM

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.06110 v1 pith:QUBFIQAT submitted 2024-06-10 cs.CL cs.AI

classification cs.CLcs.AI
keywords contexttaskscompressionlengthmethodstorageefficientlyllms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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/RCC_Transformer

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. CompLLM: Compression for Long Context Q&A

    cs.CL 2025-09 conditional novelty 6.0 of 10

    A segment-wise soft compression method that provides up to 4x TTFT speedup, 2x KV cache reduction, and comparable or better QA quality at 2x compression.

  2. A Survey of Mamba

    cs.LG 2024-08 unverdicted novelty 2.0 of 10

    The paper consolidates existing research on Mamba models, their architecture variants, adaptations to different data modalities, and applications across domains.

Pith tools