Don't Search for a Search Method -- Simple Heuristics Suffice for Adversarial Text Attacks
원문 초록
Recently more attention has been given to adversarial attacks on neural networks for natural language processing (NLP). A central research topic has been the investigation of search algorithms and search constraints, accompanied by benchmark algorithms and tasks. We implement an algorithm inspired by zeroth order optimization-based attacks and compare with the benchmark results in the TextAttack framework. Surprisingly, we find that optimization-based methods do not yield any improvement in a constrained setup and slightly benefit from approximate gradient information only in unconstrained setups where search spaces are larger. In contrast, simple heuristics exploiting nearest neighbors without querying the target function yield substantial success rates in constrained setups, and nearly full success rate in unconstrained setups, at an order of magnitude fewer queries. We conclude from these results that current TextAttack benchmark tasks are too easy and constraints are too strict, preventing meaningful research on black-box adversarial text attacks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization
Breaking BERT: Gradient Attack on Twitter Sentiment Analysis for Targeted Misclassification
SMAB: MAB based word Sensitivity Estimation Framework and its Applications in Adversarial Text Generation
EMPRA: Embedding Perturbation Rank Attack against Neural Ranking Models
BinarySelect to Improve Accessibility of Black-Box Attack Research
TSCheater: Generating High-Quality Tibetan Adversarial Texts via Visual Similarity
토론
이 논문과 연결된 포럼 글이 아직 없습니다.