- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes PSC-Attack for targeted transfer attacks against black-box multimodal large language models. It augments target-image feature alignment with textual guidance organized into a progressively weighted semantic chain. The authors first introduce a predefined chain and then propose a Minimum-Redundancy Semantic Chain (MRSC), which greedily selects semantic units using target relevance and redundancy. Experiments report improved attack success rates and semantic similarity across open-source, closed-source, and reasoning-oriented models.
Critical strengths
-
Organizing target descriptions into explicit semantic components is a reasonable direction for investigating how textual supervision affects adversarial transfer.
-
The evaluation covers multiple model families and includes an additional 1,000-image experiment. The ablations on the image/text trade-off, redundancy penalty, and perturbation budget provide useful information about the method’s behavior.
Critical weaknesses
-
Some details are missing. Section 3.3 does not explain how the core object unit in Eq. (11) is identified, or how Compose in Eq. (12) converts selected units into a description. ClipCap is identified as the caption generator, but this does not specify these subsequent operations. The reference image encoder in Eq. (14) is also not identified. These are central algorithmic choices because they determine the selected units, their scores, and the resulting chain.
In addition, Eqs. (10)–(19) construct MRSC directly from the target description without using the predefined chain from Section 3.2. The paper should make clear that these are alternative constructions, if that is the intended design, and identify which variant is evaluated in each experiment. -
Table 1 does not precisely define the baseline and holistic textual guidance conditions or their shared optimization settings. The predefined chain in Table 1 obtains ASR = 0.89 and AvgSim = 0.648 on GPT-4o, exactly matching the final PSC-Attack results in Table 2. This requires clarification: under the same setup, these results do not show an additional benefit from MRSC; under different setups, the differences must be specified.
-
The redundancy-penalty ablation is helpful but does not replace a direct comparison of predefined and minimum-redundancy chains. Moreover, there is no controlled comparison between progressive weighting and fixed uniform weighting over the same nodes. The predefined and MRSC constructions also differ in whether descriptions accumulate selected units. Consequently, the results do not establish whether the gains come from progressive scheduling, adaptive selection, cumulative descriptions, or additional textual supervision.
-
The experiments evaluate transferability across different target models but do not assess attack effectiveness under explicitly applied defenses or defensive preprocessing, such as JPEG compression, denoising, or image purification. Evaluating models with lower attack success rates does not substitute for a controlled defense evaluation. Consequently, it remains unclear whether PSC-Attack’s improvements over existing methods persist when the adversarial perturbations are processed by a defense.
-
Section 4.3 describes Figure 2 as showing adversarial examples and corresponding perturbation maps, but the figure contains two different source-image examples and their attacked versions, without separate perturbation maps. It therefore does not directly support the comparison of perturbation intensity. Besides, the claims that AdvDiffVLM produces more visible color distortions and that PSC-Attack produces smoother perturbations than M-Attack are also not clearly established by these examples.
Questions for authors
- Appendix A.5 acknowledges additional computation, but the paper does not quantify chain-construction time, per-image attack runtime, or overhead relative to the baselines. Such measurements would help assess the performance-cost trade-off.
- Under matched settings, how does MRSC compare with the predefined chain, and how does progressive weighting compare with fixed uniform weighting over the same nodes? A node-order control would further clarify whether the proposed ordering is important.