- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies how to reduce the computational cost of latent adversarial training (LAT) for LLM-based classifiers. On the defense side, it proposes LAT-ReFT, which freezes the backbone and applies low-rank ReFT interventions over a suffix window rather than only the final token. On the attack side, it constructs a lightweight surrogate for inner-loop adversarial optimization by pruning MLP neurons according to an activation-gradient (ActGrad) importance score. The paper also provides theoretical analyses motivating suffix-window defense and the surrogate construction. Experiments on IMDB, EnronSpam, and PasswordMatch with Pythia-1.4B, Qwen2.5-3B, and Llama-3.1-8B evaluate robustness, trainable parameters, FLOPs, runtime, and memory. The proposed approach reduces adversarial-training FLOPs by 29.6% on average and uses a very small fraction of trainable parameters, while incurring some loss in robustness compared with full-parameter LAT.
Critical strengths
- The paper presents a coherent approach to reducing the cost of LAT from both the defense and attack sides. The suffix-window ReFT defense is motivated by the mismatch between multi-token attacks and position-local interventions, while the pruned surrogate targets the expensive inner-loop attack generation. The theoretical analysis and ablations generally support these design choices, making the method more than a simple combination of existing components.
- The efficiency gains are supported by both algorithmic and implementation-level evidence. In addition to FLOPs and trainable-parameter counts, the paper reports wall-clock time and peak memory reductions. The ActGrad surrogate also substantially outperforms random pruning and ActDiff at the same pruning ratio, suggesting that the attack-aware neuron selection is consequential to the method.
Critical weaknesses
- The empirical scope is relatively narrow compared with the general framing of LLM adversarial training. The main evaluation focuses on LLM-based classifiers and primarily token-level suffix attacks. It remains unclear whether the proposed robustness benefits extend to open-ended generation or to stronger adaptive attacks that explicitly exploit knowledge of the defended token window or intervention layer.
- The robustness-efficiency tradeoff is not uniformly favorable across settings, and the cross-dataset evaluation is somewhat limited. Compared with full-parameter LAT, the proposed method shows noticeable increases in attack success rate in several settings. In addition, the most complete multi-model evaluation is conducted on IMDB, while the additional datasets are mainly evaluated with Pythia-1.4B. This makes it difficult to determine how consistently the reported tradeoff generalizes across both models and tasks.
Questions for authors
- Clarification / additional evidence: How robust is LAT-ReFT to adaptive attacks that explicitly account for the defended suffix window and the intervention layer? The current GCG evaluation differentiates through the ReFT intervention, but it is not clear whether the attack is specifically adapted to exploit the known defense placement. Results or further clarification on this point would materially affect my assessment of the robustness claim.
- Clarification / additional evidence: The full three-model comparison is mainly reported on IMDB, whereas the cross-dataset results on EnronSpam and PasswordMatch are primarily shown for Pythia-1.4B. Do the authors have corresponding results for Qwen2.5-3B or Llama-3.1-8B on these datasets? This would help establish whether the reported robustness-efficiency tradeoff generalizes across both model families and tasks.
For Weakness 1: We thank the reviewer for raising this concern. Our work focuses on improving the computational efficiency of LAT for LLM-based classifiers under the established suffix-attack setting of Howe et al. [1]. As discussed in Appendix A, this setting provides a well-defined measure of attack success and is practically relevant to applications such as content moderation and filtering [2, 3]. We therefore consider LLM-based classification a meaningful research setting in its own right.
Importantly, the proposed representation-level approach is not restricted to classification. Both the inner-loop adversarial optimization and the outer-loop ReFT interventions operate on hidden representations. This provides a basis for extending the framework to open-ended generation with appropriate task objectives, which we view as a direction for future work.
Regarding adaptive attacks, our evaluation follows the established suffix-based threat model of Howe et al. [1]. GCG is performed in a white-box setting against the full defended model, with gradients computed through the ReFT interventions. Thus, adversarial suffixes are already optimized against the actual defense. In addition, Appendix C.3 evaluates alternative attack positions, including prefix and infix attacks, providing further evidence beyond the suffix setting.
For Weakness 2:
To further examine generalization across models and tasks, we extend our evaluation on EnronSpam to Qwen2.5-3B and Llama-3.1-8B.
The additional results show that the robustness trade-off varies across models. On Pythia-1.4B, LAT-ReFT achieves lower GCG ASR than full LAT (0.08 vs. 0.29). On Qwen2.5-3B and Llama-3.1-8B, LAT-ReFT achieves ASRs of 0.26 and 0.04, compared with 0.20 and 0.00 for full LAT, respectively. These results extend our evaluation beyond Pythia-1.4B and further characterize the model-dependent robustness trade-off of our framework.
For Question 1 and Question 2: These questions are addressed in our responses to W1 and W2 above. W1 discusses GCG evaluation and alternative attack positions (Appendix C.3), while W2 addresses robustness–efficiency trade-offs and cross-dataset generalization.
References
[1] Howe, Nikolaus, et al. "Scaling trends in language model robustness." arXiv preprint arXiv:2407.18213 (2024).
[2] Inan, Hakan, et al. "Llama guard: Llm-based input-output safeguard for human-ai conversations." arXiv preprint arXiv:2312.06674 (2023).
[3] Achara, Akshit, and Anshuman Chhabra. "Watching the AI watchdogs: A fairness and robustness analysis of AI safety moderation classifiers." Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 2: Short Papers). 2025.