- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
Existing transfer-based ensemble attacks typically apply computationally expensive updates throughout the iterative attack, although the same update may contribute differently to terminal transferability at different attack stages. To address this issue, the paper proposes Temporal Ensemble Scheduling (TES). TES applies a limited number of expensive method-specific updates early in the attack and then switches to inexpensive base ensemble updates, while preserving the attack state and the original number of outer iterations. To analyze stage-dependent returns, the authors define Attack Operation Value (AOV), which measures the benefit of an update by comparing terminal transfer utility from the same incoming attack state under different updates followed by a common continuation rule. TES is applied to CWA, SMER, and SVRE and evaluated on image and point-cloud datasets. The experiments show that TES substantially reduces runtime while maintaining competitive transferability and, in some settings, outperforms the full schedule that applies method-specific updates at every iteration. Additional controls on scheduling, optimizer state, and parameter sensitivity support its effectiveness and help characterize its scope of applicability.
Critical strengths
1.While the proposed scheduling method is simple, its practical value is clear. Expensive ensemble updates need not be applied throughout the entire attack: a short early refinement prefix can substantially reduce runtime while maintaining or even improving transferability. For example, Table 5 reports ASR gains of approximately 3.27, 2.77, and 2.92 percentage points for CWA, SMER, and SVRE, respectively, on NIPS2017, together with speedups of approximately 43.3%, 74.4%, and 70.5%.. 2.This paper includes early, middle, and late placement comparisons with matched update counts, as well as uniform and random schedules, extended-base controls, short-refinement controls, different surrogate compositions, and attack-seed repetitions. The authors also appropriately distinguish the target panels used for mechanism analysis and method evaluation, and acknowledge settings in which TES underperforms Full. These controls make the contribution more convincing than a comparison between TES and the original attacks alone.
Critical weaknesses
1.The novelty of the contribution and the generality of the scheduling rule remain limited, and the separation between schedule selection and independent evaluation needs further clarification. AOV is a useful diagnostic contrast, but its value depends on the incoming state, intervention window, continuation policy, and evaluation targets. The paper does not yet establish a relationship that predicts when refinement is beneficial or how to select the prefix length. The default configuration, K = 0.2T, is chosen based on the CWA prefix-length experiments, and its effectiveness varies across settings. For example, Table 37 reports 72.90% ASR for the 20% prefix versus 76.48% for Full in point-cloud SMER at T = 30. In Table 39, image CWA with the M2 surrogate ensemble achieves 19.39% ASR with TES, below the 21.20% achieved by Base. 2.The existing budget-allocation experiments primarily match reference gradient-computation counts and do not fully establish the advantage of TES over extended-base and short-refinement controls under equal wall-clock budgets. Appendices D.5 and E clearly distinguish reference computation from runtime, but gradient counts do not capture all method-dependent costs, including additional forward evaluations and ensemble-weight updates. Some SVRE controls also use approximately rather than exactly matched reference counts. Consequently, the experiments convincingly demonstrate computational savings relative to the evaluated Full implementations, but the evidence remains insufficient to establish the best allocation under an equal wall-clock budget.
Questions for authors
1.Which samples, surrogate models, and target models were used to select K = 0.2T? Do these settings overlap with those used for the final method evaluation? Although the appendix distinguishes the model panels used for mechanism analysis and method evaluation, the independence of schedule selection from final evaluation needs further clarification. Can the authors verify whether this default configuration remains competitive on samples and target models that were not used for prefix selection? 2.Do the advantages of TES over extended-base and short-refinement controls persist under matched wall-clock budgets on an exclusive GPU? A representative comparison on image and point-cloud tasks would help support the conclusions about compute allocation. 3.Please clarify the source, label mapping, and train/test split of the evaluated ShapeNet HDF5 data, and explain how parity between the adapted attack implementations and their native implementations was checked.
Follow-up on our rebuttal
Dear Reviewer 5WgH,
Thank you for your careful review and for raising questions about the experimental controls and the interpretation of our results. As the discussion period draws to a close, we would appreciate any feedback you have on our two-part response. If any of your questions remain open, please let us know and we would be happy to clarify.
Best regards, The authors