A layer-uncertainty-based budget allocator for KV cache compression slightly outperforms uniform-budget and pyramid-budget baselines on LongBench and Needle-in-a-Haystack.
MoDification: Mixture of Depths Made Easy
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Long-context efficiency has recently become a trending topic in serving large language models (LLMs). And mixture of depths (MoD) is proposed as a perfect fit to bring down both latency and memory. In this paper, however, we discover that MoD can barely transform existing LLMs without costly training over an extensive number of tokens. To enable the transformations from any LLMs to MoD ones, we showcase top-k operator in MoD should be promoted to threshold-p operator, and refinement to architecture and data should also be crafted along. All these designs form our method termed MoDification. Through a comprehensive set of experiments covering model scales from 3B to 70B, we exhibit MoDification strikes an excellent balance between efficiency and effectiveness. MoDification can achieve up to ~1.2x speedup in latency and ~1.8x reduction in memory compared to original LLMs especially in long-context applications.
fields
cs.CL 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
ZigZagkv: Dynamic KV Cache Compression for Long-context Modeling based on Layer Uncertainty
A layer-uncertainty-based budget allocator for KV cache compression slightly outperforms uniform-budget and pyramid-budget baselines on LongBench and Needle-in-a-Haystack.