2025
EMNLP
EMNLP 2025
LeanK: Learnable K Cache Channel Pruning for Efficient Decoding
Abstract
AbstractLarge language models (LLMs) enable long-context tasks but face efficiency challenges due to the growing key-value (KV) cache. We propose LeanK, a learning-based method that prunes unimportant key (K) cache channels by leveraging static channel sparsity. LeanK reduces GPU memory and accelerates decoding without sacrificing accuracy. Experiments demonstrate up to 70% K cache and 16%–18% V cache memory reduction, and 1.45× decoding speedup. We also provide insights into model channels and attention heads during long-context inference by analyzing the learned importance distribution. Our code is anonymously available at https://anonymous.4open.science/r/LeanK-7A87/README.md.
🌉
Interdisciplinary Bridge
— Artificial Intelligence and Deep Learning and Machine Learning
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio
Authors
Topics
Artificial Intelligence > Core AI > Model Compression
Machine Learning > Application Areas > Efficient Computing
Deep Learning > Architectures > Transformers
Machine Learning > Application Areas > Model Compression
Artificial Intelligence > Core AI > Efficient Computing
Deep Learning > Optimization & Theory > Model Compression
Deep Learning > Optimization & Theory > Efficient Computing