Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries
원문 초록
We introduce Lexico, a novel KV cache compression method that leverages sparse coding with a universal dictionary. Our key finding is that key-value cache in modern LLMs can be accurately approximated using sparse linear combination from a small, input-agnostic dictionary of ~4k atoms, enabling efficient compression across different input prompts, tasks and models. Using orthogonal matching pursuit for sparse approximation, Lexico achieves flexible compression ratios through direct sparsity control. On GSM8K, across multiple model families (Mistral, Llama 3, Qwen2.5), Lexico maintains 90-95% of the original performance while using only 15-25% of the full KV-cache memory, outperforming both quantization and token eviction methods. Notably, Lexico remains effective in low memory regimes where 2-bit quantization fails, achieving up to 1.7x better compression on LongBench and GSM8K while maintaining high accuracy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
any4: Learned 4-bit Numeric Representation for LLMs
CommVQ: Commutative Vector Quantization for KV Cache Compression
Segment Policy Optimization: Effective Segment-Level Credit Assignment in RL for Large Language Models
Analog Foundation Models
DAC: A Dynamic Attention-aware Approach for Task-Agnostic Prompt Compression
MGVQ: Could VQ-VAE Beat VAE? A Generalizable Tokenizer with Multi-group Quantization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.