Meta-Soft: Leveraging Composable Meta-Tokens for Context-Preserving KV Cache Compression
Wei Luo, Yi Huang, Songchen Ma, Huanyu Qu, Jiang Cai, Mingkun Xu

TL;DR
Meta-Soft introduces a dynamic, probe-driven framework for compressing KV caches in large language models, enhancing context preservation and efficiency over static methods.
Contribution
It proposes a novel Meta-Soft framework with learnable basis matrices and attention-based integration for adaptive KV cache eviction in LLMs.
Findings
Outperforms existing state-of-the-art eviction methods.
Effectively preserves context information during compression.
Improves decoding efficiency with long input sequences.
Abstract
The KV cache used in large language models has linearly growing time complexity, so LLMs face memory blow-up and reduced decoding efficiency when they process long contexts.Current KV Cache eviction has become an important research direction; however, existing methods based on fixed Soft Tokens (e.g., Judge Q) rely on a static parameter set as the query to evaluate the importance of KV pairs, so they cannot adapt dynamically to different input prompts, and they cannot precisely capture complex and changing task relevance.Also, evicted KV pairs are discarded permanently, so this causes irreversible information loss and context breaks. To address this problem, we propose Meta-Soft, a dynamic compression framework based on probe-driven context integration. Specifically, we build a meta-library with a learnable orthogonal basis matrix , and we use a selector network with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
