PuzzleKV reduces KV cache memory with page-wise low-rank decomposition for compression.
Read the original at arxiv.org→arXiv:2608.23843v1 Announce Type: new Abstract: Long-context inference in large language models (LLMs) is increasingly limited by the memory required for the key-value (KV) cache. KV cache compression addresses this...
Original headline: "PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression"
Coverage timeline
- Aug 26, 04:00 UTC arXiv cs.LG lead source PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression
- Aug 27, 04:00 UTC arXiv cs.AI Minima-KV: Retention-Preserving KV Cache Compression with Mixed-Format Paged Attention