Summary
This paper proposes a new hard-label black-box attack on textual data that aims to improve the performance on semantic similarity and perturbation rate. The main novel techniques are word back-substitution and a new strategy for optimizing the adversarial example. Evaluations on 5 classification tasks, 3 inference tasks, and 2 online APIs show that the proposed attack obtains better quality than 3 previous attacks. Evaluations also include the attack's convergence, the performance on robust models, and several ablation studies.
Strengths
### Originality
* **Novel attack.** The attack techniques are overall novel to my knowledge. The proposed strategy to optimize quality is new.
### Quality
* **Solid methodology.** The overall attack design is solid, and the new optimizing strategy is well-developed.
* **Comprehensive evaluations.** The experiments are comprehensive. I appreciate the several tasks and the inclusion of robust models and ablation studies.
### Clarity
* **Good presentation.** The paper is generally well-written and the methodology is largely easy to follow with some focus.
### Significance
* **Improved performance regarding quality.** It is good to see that the proposed optimization strategy can improve the adversarial example's quality in all settings. The convergence behavior is also better than previous attacks.
Weaknesses
### Originality
**Q1: Unclear novelty in the word back-substitution component.**
I was a bit confused by the contribution in Section 4.2. From L149-153, it seems that previous attacks only compute the similarity gain once and hence determining the replacement order, so the initially computed order is inaccurate after the adversarial example has applied any replacement. However, isn't this the same case for Equation (3) and Algorithm 1, where the order is computed once (Algorithm 1, L2-7), and then the attack applies replacements one by one (Algorithm 1, L10-17)? Basically, it is unclear how the proposed method is different from previous attacks, and how it would be able to solve this problem.
If there is indeed a difference, what if previous attacks do recompute this order at each iteration? Would they have better performance, or is there an inherent challenge in their methodology? From the current presentation I could not see any challenge, as this computation is generally offline and does not need model queries. In other words, in this part of the question, it is hard to evaluate the novelty between "naively recomputing the order" and "recomputing the order with the proposed strategy."
### Quality
**Q2: The qualitative results are somewhat insufficient.**
While the quantitative results in Section 5 are good and promising, the current qualitative results are a bit insufficient for demonstrating the improved quality. Currently, only three sentences are provided in the supplementary, and it would be hard to tell if they have covered the general sense of improved quality. Since this paper's main claim is the improved quality of adversarial examples, it might be important to have more examples of the adversarial examples and, more importantly, the comparisons between different attacks. It is not intuitive to tell the difference between 5-10% of similarity or perturbation rate improvement. For example, would there be an observable quality improvement if the semantic similarity was improved by 10%? Note that I have no concerns with the chosen metrics, but the paper can be strengthened if more qualitative results are provided.
**Q3: The choice of $k$.**
At L259, the number of synonyms sampled for direction estimation is set to $k=5$. I am curious if this value would be too small, given that there might be tens of synonyms. I also noticed that the results are constant regarding $k\in\{5, 10, 15\}$ so $k=5$ seemed to be sufficient. Is there any explanation for why this is sufficient? In this case, it might be informative to add results for $k\in[1, 4]$ where the number of samples is insufficient.
### Clarity
**Q4: Confusion in determining the optimizing order.**
It is not very straightforward why Section 4.3.1 determines that the most similar word pair get optimized first. In Equation (6), the word $w_i$ gets sampled with a higher probability if $d_i$ is small, meaning the cos similarity between (the embeddings of) $w_i$ and $w^\prime_i$ is high. Can you clarify why it starts from similar words (rather than non-similar words), and replace such similar words with synonyms that again aim to improve semantic similarity?
**Q5: Confusion in the final updating step.**
In L224-225, why the replacement word is chosen from $S(w_i)$, yet the similarity was compared pertaining $\bar{w}_i$?
**Minor Points:**
* Missing specification of the synonyms set. It is unclear how the synonyms were generated and how large it is (relevant to Q3).
* The methodology description in Section 4.3.2 is a bit convolved.
### Significance
**Q7: Used the same random initialization as previous attacks.**
While the improvement in quality is promising, and this paper legitimately focuses on improving the quality, the task's performance is not reduced more than other attacks because they share the same initialization (source of the adversary). I am not penalizing for this point, but this is one aspect that limits the significance of this paper (compared with attacks that might also improve the attack success rate).
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.