- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes CLOUD, a compression-aware adversarial attack framework for large vision-language models (LVLMs). CLOUD leverages multiple compression surrogates to estimate adaptive attack budgets, followed by DPP-based token selection and optimal transport-based perturbation optimization to disrupt post-compression visual representations. Experiments across multiple LVLMs and token compression methods demonstrate improved attack effectiveness over existing baselines.
Critical strengths
-
Clear and Well-Organized Presentation. The paper is well-written, with a clear structure and logical flow. The motivations, methodological designs, and technical details are presented clearly, making the proposed framework easy to follow.
-
Useful Empirical Analyses. The paper provides detailed ablation studies and visualizations that help illustrate the roles of different components and offer insights into adversarial attacks under visual token compression.
Critical weaknesses
1. Limited Practicality of the Threat Model and Incremental Methodological Novelty.
The threat model raises concerns regarding the practical applicability of the proposed attack. Although the target compression strategy is assumed to be unknown, the attack still relies on access to a differentiable vision encoder for perturbation optimization. Such an assumption limits the practical significance of the proposed method, particularly for real-world black-box LVLM services. Furthermore, despite its seemingly sophisticated design, CLOUD appears to be largely an incremental extension of CAGE rather than a fundamentally new attack paradigm. The proposed framework combines several established techniques, including Bayesian optimization, Entmax, DPP, and optimal transport, to improve token selection and perturbation optimization. However, the underlying motivation remains closely aligned with CAGE: identifying and disrupting visual evidence that can influence the model after token compression. The authors should more clearly articulate the fundamental novelty beyond combining existing optimization techniques and justify whether the additional methodological complexity is necessary.
2. Limited Empirical Improvements, Insufficient Baseline Comparisons, and Unclear Generalization.
The empirical improvements over the strongest baseline, CAGE, are relatively modest or inconsistent across several experimental settings, raising questions about whether the additional complexity of CLOUD is sufficiently justified. For example, on LLaVA, the average improvements over CAGE on GQA are only 0.4–1.3 percentage points, while those on ScienceQA are similarly limited. Although larger improvements are observed in some Qwen3-VL settings, the overall advantage is not consistently substantial. Moreover, the adversarial comparisons are insufficiently comprehensive, including only VEAttack and CAGE, with CAGE being the only baseline specifically designed for token-compressed LVLMs. This makes it difficult to establish the broader competitiveness of the proposed approach. Another important concern is generalization to genuinely unseen compression methods. Although the paper evaluates several existing compression schemes, it remains unclear whether CLOUD would remain effective against a fundamentally new compression mechanism with substantially different token-selection or merging behaviors. A held-out compression-method evaluation would provide stronger evidence for the claimed transferability and practical generalization.
Questions for authors
-
Given the reliance on access to a differentiable vision encoder, can CLOUD generalize to fully black-box LVLM settings where neither the model architecture nor its gradients are accessible?
-
Given the limited improvements over CAGE in several settings, can the authors justify the additional methodological complexity and provide comparisons with more adversarial attack baselines?
-
Can the authors evaluate CLOUD against entirely unseen token compression methods to further demonstrate its generalizability?