Life of Research
Appearance

Subject

KV cache compression

2 open-access journal articles on KV cache compression, published in 2026 in Life of Research. Every record is free to read and download, with a permanent link and a ready-made citation.

2 records

Journal article

Lossless at What Length? Near-Lossless KV Cache Compression Is a Claim Indexed by Decode Exposure, Scoring Statistic and Budget Accounting, the Decode-Aware Line Has Answered the First Index Mostly on Final-Answer Accuracy, and Divergence From the Full Cache Is Not by Itself the Defect

Key-value cache compression is routinely reported as near-lossless at aggressive budgets: eviction, quantisation and merging methods keep a fifth or a tenth of the cache and match the full-cache score. A 2025-2026 line of work argues that the result was manufactured by evaluation, because the…

Cite Related research LOR-00106 · 7 views · 8 downloads
PDF383.7 KB

Journal article

Compressed Once, Read Many Times: Why Prompt-Compression Results Do Not Transfer to Agent Memory, What the Query-Agnostic Line Already Showed, and the Two Properties of a Memory Write No Protocol Yet Scores

Language-model agents that remember across sessions compress what they store: they summarise dialogue, extract facts, or evict cache entries, and then answer later questions from what is left. The compression ratios used to justify these designs come mostly from prompt-compression work in which…

Cite Related research LOR-00053 · 6 views · 7 downloads
PDF8.9 MB

Cite

APA

BibTeX


  
  

Import into a reference manager: BibTeX · RIS (Zotero, Mendeley, EndNote)