New papers tackle KV cache compression for LLM serving

Multiple arXiv papers propose KV cache compression methods: Minima-KV uses mixed-format paged attention, PuzzleKV applies page-wise low-rank decomposition, and KVBoost enables chunk-level reuse with deviation-guided recomputation. Others explore tradeoffs between tensor parallelism and KV compression, and question when attention is compressible.