2021
DOI: 10.1109/tkde.2021.3117608
|View full text |Cite
|
Sign up to set email alerts
|

Towards a Robust Deep Neural Network against Adversarial Texts: A Survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
33
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 41 publications
(33 citation statements)
references
References 128 publications
0
33
0
Order By: Relevance
“…4. Consistent with prior black-box attack settings [8], [13], [14], [28], [42], the hacker can query the target model with a text example š’˜ consisting of a sequence of š‘ tokens (š’˜ = [š‘¤ 1 , š‘¤ 2 , ā€¦ , š‘¤ š‘ ]). The model will return the predicted class as š‘¦, i.e., ā„±(š’˜) = š‘¦, as well as the predicted probability for class š‘¦ ā„± š‘¦ (š’˜).…”
Section: Proposed Adversarial Text Attack Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…4. Consistent with prior black-box attack settings [8], [13], [14], [28], [42], the hacker can query the target model with a text example š’˜ consisting of a sequence of š‘ tokens (š’˜ = [š‘¤ 1 , š‘¤ 2 , ā€¦ , š‘¤ š‘ ]). The model will return the predicted class as š‘¦, i.e., ā„±(š’˜) = š‘¦, as well as the predicted probability for class š‘¦ ā„± š‘¦ (š’˜).…”
Section: Proposed Adversarial Text Attack Methodsmentioning
confidence: 99%
“…Explainable DL methods can be broadly grouped into two categories: the global and the local explainable methods, depending on the scope of the explanation [8]. Global explainable methods enable people to inspect and visualize the model structures and parameters.…”
Section: Insights From Explainable DL Studiesmentioning
confidence: 99%
See 2 more Smart Citations
“…Existing black-box attacks, from character-level flipping [8] to sentence-level paraphrasing [9], all achieve good performance. In Particular, the word-level attack method based on word replacement performs particularly well in terms of attack efficiency and adversarial example quality [10]. This kind of method can be viewed as a combinatorial optimization problem that combines search space reduction and adversarial example search [11].…”
Section: Introductionmentioning
confidence: 99%