- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper asks whether fixed bounds on internal activations improve the adversarial robustness of a transformer classifier. It compares a hard cap, which clips large activations, and a smooth tanh-based cap, applied at one of several locations in DistilRoBERTa (embeddings, query/key, attention output, MLP, and logits). The cap level is calibrated on the activations of a trained uncapped model and then frozen, and the smooth cap is matched to the hard cap so that both change the activations by the same average amount. Models are retrained with the caps and evaluated on IMDb against embedding-space PGD attacks, using multiple seeds, paired statistical tests, and equivalence testing. The caps preserve clean accuracy but do not improve robustness at any location, and some caps reduce robustness under a smaller attack budget. An adversarial training baseline is much more robust, which shows that the evaluation can detect a truly robust model.
Critical strengths
-
The experimental and statistical design is careful: matched seeds, paired tests with multiplicity correction, equivalence testing instead of inferring "no effect" from non-significance, adaptive attacks with BPDA for hard caps, and a FreeLB-style positive control showing that the evaluation can detect a robust model.
-
The paper reports all configurations and results honestly, including negative and unresolved outcomes, and the distortion-matching idea gives a fair way to compare hard and smooth operators at the same intervention strength.
Critical weaknesses
-
The studied method has almost no effect, so the paper offers little useful information. Across all locations and both cap types, the caps neither help nor clearly hurt, and the results are mostly null or unresolved. This is partly built into the setup: under the main attack budget, almost every model, including the uncapped control, is broken on nearly all examples, so no method could show an improvement.
-
The contribution is limited. The method is simple clipping, and the theory is basic: Theorem 1 follows directly from the fact that a continuous, decreasing function has a unique solution, and the other results are standard bounds. A negative result can be useful, but this one neither challenges a common belief nor explains why the caps fail.
-
The scope is narrow. The study uses one small model, one binary sentiment dataset, and one cap level. The attack changes word embeddings directly rather than real text, and under a real word-substitution attack (TextFooler), capped and uncapped models behave almost the same. It is unclear whether the findings matter in practice.
-
The paper is hard to read and hard to reproduce. Most of the text is spent on statistical and procedural caveats, which hide a simple main message. Only result files are released, without training or attack code, and the appendix reports code fixes made after accessing the test set and an excluded experiment.
Questions for authors
-
What new insight does this negative result provide beyond prior work showing that bounded activations do not imply robustness, and can the authors explain why the caps fail?
-
Do the conclusions hold for larger models, multiclass tasks, other datasets, or realistic text attacks?
-
Will the authors release the training and attack code, and can the main text be shortened to focus on the core findings?