On Adversarial Examples for Text Classification by Perturbing Latent Representations

May 06, 2024 ยท Declared Dead ยท ๐Ÿ› LatinX in AI at Neural Information Processing Systems Conference 2022

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Korn Sooksatra, Bikram Khanal, Pablo Rivas arXiv ID 2405.03789 Category cs.LG: Machine Learning Cross-listed cs.AI, cs.CL, cs.CR Citations 3 Venue LatinX in AI at Neural Information Processing Systems Conference 2022 Last Checked 4 months ago
Abstract
Recently, with the advancement of deep learning, several applications in text classification have advanced significantly. However, this improvement comes with a cost because deep learning is vulnerable to adversarial examples. This weakness indicates that deep learning is not very robust. Fortunately, the input of a text classifier is discrete. Hence, it can prevent the classifier from state-of-the-art attacks. Nonetheless, previous works have generated black-box attacks that successfully manipulate the discrete values of the input to find adversarial examples. Therefore, instead of changing the discrete values, we transform the input into its embedding vector containing real values to perform the state-of-the-art white-box attacks. Then, we convert the perturbed embedding vector back into a text and name it an adversarial example. In summary, we create a framework that measures the robustness of a text classifier by using the gradients of the classifier.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted