LGSep 25, 2024

AlignedKV: Reducing Memory Access of KV-Cache with Precision-Aligned Quantization

arXiv:2409.16546v25 citationsh-index: 6
Originality Incremental advance
AI Analysis

This work addresses memory bottlenecks for efficient LLM deployment, representing an incremental improvement in quantization methods.

The paper tackles the problem of high memory access latency in LLM inference by proposing a dynamic KV-Cache quantization technique based on a 'precision alignment' criterion, achieving a 25% reduction in memory access and up to 1.3x speedup in attention computation with minimal precision loss.

Model quantization has become a crucial technique to address the issues of large memory consumption and long inference times associated with LLMs. Mixed-precision quantization, which distinguishes between important and unimportant parameters, stands out among numerous quantization schemes as it achieves a balance between precision and compression rate. However, existing approaches can only identify important parameters through qualitative analysis and manual experiments without quantitatively analyzing how their importance is determined. We propose a new criterion, so-called 'precision alignment', to build a quantitative framework to holistically evaluate the importance of parameters in mixed-precision quantization. Our observations on floating point addition under various real-world scenarios suggest that two addends should have identical precision, otherwise the information in the higher-precision number will be wasted. Such an observation offers an essential principle to determine the precision of each parameter in matrix multiplication operation. As the first step towards applying the above discovery to large model inference, we develop a dynamic KV-Cache quantization technique to effectively reduce memory access latency. Different from existing quantization approaches that focus on memory saving, this work directly aims to accelerate LLM inference through quantifying floating numbers. The proposed technique attains a 25% saving of memory access and delivers up to 1.3x speedup in the computation of attention in the decoding phase of LLM, with almost no loss of precision.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes