- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2(+1)
- Soundness
- 3(+1)
Read review
Paper summary
The paper proposes AlignPred, an error-controlled KV-cache compression method designed to reduce persistent KV-cache storage. Experimental results demonstrate promising trade-offs between storage rate and downstream task performance, particularly at lower storage rates.
Critical strengths
The motivation is supported by useful illustrations. Figures 2 and 3 help demonstrate the potential benefits of exploiting cross-block dependencies through alignment-based prediction, while Figure 1 provides context for persistent KV-cache storage.
Critical weaknesses
-
Unclear research motivation and limited methodological novelty. The research question and its distinction from existing methods, such as KVTC and KVComp, are not sufficiently articulated, making the proposed approach appear to be an incremental combination of established techniques. This concern is further amplified by the unclear organization and transitions in the Introduction. For example, the discussion moves from error-controlled KV-cache compression to predictive coding without clearly explaining the connection between these concepts. Similarly, the discussion in lines 72–85 is not sufficiently connected to the preceding motivation.
-
Limited or unclear improvements from the proposed mechanism. Although Figure 8 demonstrates near-native downstream performance at reduced storage rates, it remains unclear to what extent these improvements can be attributed to the proposed alignment-based prediction mechanism. In Table 2, the incremental storage reduction from inter-block prediction is relatively small, particularly for DeepSeek, where the improvement is less than 1%. Can the authors explain why the benefit varies across different models and attention architectures? Furthermore, the main takeaways from Section 5.4 are not sufficiently emphasized.
Questions for authors
- Can you explain the specific limitations of existing approaches and explain how the proposed alignment-based prediction addresses them? (Improve current presentation in the introduction for clear definition of research question and why proposed methods are needed).
- My last two questions in weakness point 2.
3 comments
Thank you for your constructive feedback
Thank you for your constructive feedback. We have clarified the research motivation, methodological contribution and component attribution, including the model-dependent results. Please feel free to ask any follow-up questions.
Thank you for your response. I don't have any further concerns. I raised presentation and soundness score.
W1 / Q1 Research motivation and methodological contribution && W2 / Q2 Gain attribution and model-dependent effects
W1 / Q1 Research motivation and methodological contribution
Thank you for highlighting this gap in the presentation. Our research question is: how can we exploit dependencies across KV heads or layers to reduce persistent storage under an explicit reconstruction-error budget?
This question arises from a practical deployment need: application teams are often reluctant to adopt lossy KV compression without explicit numerical-error control. The error budget specifies the acceptable distortion, but does not determine how efficiently the cache is represented within that budget. AlignPred addresses this second problem through alignment-conditioned predictive coding.
The key observation is that related heads or layers may contain correlated information expressed in different coordinate systems. Direct prediction cannot fully exploit this structure when corresponding coordinates are misaligned. We therefore learn compact local rotations, align the representations, and predict each block from previously reconstructed related blocks. Error-controlled residual coding then encodes what the prediction does not capture. This explains the connection between error control and predictive coding: error control sets the fidelity constraint; alignment and prediction reduce the storage required under that constraint. Table 2 supports the importance of this interaction: cross-block prediction increases storage without alignment but reduces it after alignment.
The distinction from the cited methods is also important. KVTC uses PCA-based joint transforms to concentrate information before quantization; AlignPred uses local coordinate alignment to expose dependencies for predictive residual coding. KVComp targets GPU-resident caches and fused decompression–attention computation, where prediction dependencies introduce execution overhead. AlignPred targets persistent storage, allowing predictive reconstruction during cache restoration, outside the attention kernel.
Our contribution is the complete method that connects these choices: reusable local alignment, closed-loop cross-block prediction, error-controlled residual coding, and native cache save/restore integration. We will reorganize the Introduction around the deployment motivation, the unresolved KV-structure problem, and this design rationale. We will also rewrite lines 72–85 to connect each design choice directly to the research question.
W2 / Q2 Gain attribution and model-dependent effects
AlignPred is a complete compression method whose components contribute jointly to the overall storage reduction. Section 5.4 isolates their contributions: alignment makes cross-block prediction effective, while intra-block prediction and residual coding provide complementary savings. The small cross-block increment is therefore an additional benefit, rather than the overall gain of AlignPred.
Its magnitude varies with the available KV correlations. DeepSeek’s native CSA/C4 compression may leave less cross-layer redundancy to exploit; Appendix Figure 12 shows weaker aligned inter-layer same-bit mutual information than in GLM. This helps explain its smaller cross-block gain. We will make the component contributions and model-dependent behavior clearer in Section 5.4.