- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Towards the issue of high inference overhead in anomaly detection using MLLMs, this paper proposes AnomalyKV, a novel anomaly-aware KV cache compression framework. This method performs fine-grained KV cache budget allocation, enabling instance-level dynamic compression across different samples. The general idea is to first compute an anomaly map for each sample, then convert it into an importance field through boundary diffusion, and adaptively set a retain threshold to preserve the patches with the highest scores. Extensive experiments demonstrate that AnomalyKV significantly improves inference efficiency while maintaining comparable performance across multiple mainstream MLLMs.
Critical strengths
- The issue addressed in this paper is valuable: the inference cost of using MLLM in anomaly detection is high. Considering how to reduce the inference cost of MLLM, this paper addresses this issue from the perspective of KV cache compression.
- The motivation behind the entire method is clear: anomaly-aware KV cache compression, which aims to retain as much of the KV cache in anomaly-related areas as possible, thus avoiding the loss of anomaly information after compression. The entire method is designed in a fancy yet reasonable manner, revolving around this motivation. Experimental results show that it achieves an improvement in inference speed while maintaining detection performance.
Critical weaknesses
- The innovation is limited. First, an anomaly map is calculated, and then patches that are more likely to be abnormal areas are selected and retained based on the anomaly map. This is a fairly common compression method that can be thought of for anomaly detection.
- In LAMS, an anomaly map can only be obtained by comparing features with N images on the L layer. Does N refer to all the images for the class in the dataset? Then the cost of calculating the anomaly map would be very high.
- In Section 3.2, why do we still need to obtain the importance field through diffusion fields? Can't we directly use the anomaly map to select which tokens to retain? Why does the anomaly map need to be converted into a bounding box set first, and then into an importance field? This approach makes it more complicated. What are the advantages of doing so? There is also no ablation experiment to analyze the necessity of this module.
- What about the compression on normal samples? If the normal samples also save areas that are more likely to be abnormal, and the model inference only sees part of the area instead of the whole image, will it easily lead to misjudgments of normal samples?
- The comparison method: SnapKV, AdaKV, and PyramidKV are all methods in the LLM field, so strictly speaking, the comparison is not very fair. It is also advisable not to include all ablation experiments in the appendix. The results of the most crucial experiments should be presented in the main text.
Questions for authors
- Table 1 doesn’t present numerical results for inference cost, with comparisons only shown in Figure 3. How can we confirm that Table 1 and Figure 3 are corresponding? If Figure 3 only focuses on maximizing speed without considering performance, actually with loss of performance.
- Is this method applicable to inputting multiple images simultaneously? The mainstream paradigm of AD MLLM generally inputs one or multiple normal reference images simultaneously, which is more reasonable in anomaly detection. In this case, how should it be compressed? Are existing methods still applicable?