LagKV: Lag-Relative Information of the KV Cache Tells Which Tokens Are Important

Code

• github.com/ai-lab-china-merchants-bank/lagkv
  OfficialIn paperpytorch★ 6

Abstract

The increasing size of the Key-Value (KV) cache during the Large Language Models long-context inference is the main obstacle for its balance between the deployment cost and task accuracy. To reduce the KV cache size in such scenarios, most previous efforts leveraged on the attention weight to evict non-critical cache tokens. But there is a trade-off in those methods, they usually require major modifiation of the inference infrastructure and significant computation overhead. Base on the fact that the Large Lanuage models are autoregresssive models, we propose LagKV, a KV allocation strategy only relying on straight forward comparison among KV themself. It is a totally attention free method which offers easy integration to the main stream inference platform and comparable performance comparing to other complicated KV compression methods. Results on LongBench and PasskeyRetrieval show that, our approach achieves nearly zero loss when the ratio is 2 and 90\% of the original model performance for 8. Especially in the 64-digit passkey retrieval task, our mehod outperforms the attention weight based method H_2O over 60\% with same compression ratios. Our code is available at https://github.com/AI-Lab-China-Merchants-Bank/LagKV.

Reproductions