- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper targets visual token compression for multi-turn VLM serving. In this setting, the visual KV cache persists across turns, so query-conditioned pruning must either keep the full KV to re-select tokens every turn or freeze a first-turn selection that goes stale. The proposed C3 is training-free: at the first turn it applies farthest-point sampling to the LLM-input visual features, caches only the KV of the selected tokens, and reuses it for all later turns. The paper motivates this with a k-center worst-case argument. Validation uses three 7B VLMs on eight single-turn VQA benchmarks grouped into synthetic dialogues. C3 beats frozen query-conditioned baselines, cuts the persistent visual KV by 6.7×, and gives the lowest cumulative TTFT.
Critical strengths
-
Relevant deployment question. Visual token pruning is usually evaluated single-pass. Framing multi-turn serving by its persistent visual-KV footprint is a useful lens and gives the work practical motivation.
-
Simple and easy to deploy. C3 is training-free, needs no attention maps (so it works with FlashAttention), and pays its selection cost once per image. Its weight is limited, though: the method is identical to DivPrune, and a cached random subset performs nearly as well.
Critical weaknesses
-
Outdated base models. Experiments use only Qwen2-VL, LLaVA-1.5, and LLaVA-OneVision, although Qwen3.5, Qwen3.6 and Qwen3.8 are now available. Qwen2.5-VL is even wired into the supplementary code but not reported. Please evaluate at least on Qwen3-VL and Qwen3.5 / Qwen3.6.
-
A key comparison is missing. Every Re-Prune baseline is compute-matched, so it keeps fewer than 15% of tokens per turn. There is no every-turn query-conditioned re-pruning at an equal 15% token count. That arm is the accuracy upper bound needed to show what C3 sacrifices by ignoring the query.
-
Limited novelty. The selection rule is identical to DivPrune; recasting max-min dispersion as k-center does not change the algorithm. A cached random subset is within 1–2.6 points of C3, so the coverage criterion itself contributes little.
-
Flawed multi-turn setting. Earlier questions and answers are evicted from the cache, which breaks follow-up questions and coreference and would seriously hurt the user experience. Under this protocol C3 reduces to single-turn DivPrune. Please evaluate with history retained, on real multi-turn benchmarks such as MMDU and ConvBench.
Questions for authors
-
Newer base models. Please report the main results on at least Qwen3.5, whose high-resolution inputs are exactly the regime C3 targets.
-
Equal-token re-pruning. Please add every-turn query-conditioned re-pruning at the same 15% token count as C3, with the full KV resident. This would show how much accuracy C3 gives up by ignoring the query.