TextVerifier: Robustness Verification for Textual Classifiers with Certifiable Guarantees (2023.findings-acl)
Copied to clipboard
| Challenge: | a textual classifier must withstand word-level alteration attacks due to inherent vulnerability. |
| Approach: | They propose a formal verification framework with certifiable guarantees on deep neural networks in natural language processing against word-level alteration attacks. |
| Outcome: | The proposed framework provides an approximation of the maximal safe radius with tight bounds . it yields an efficient speed edge and reliable anytime estimation . |
Similar Papers
CERT-ED: Certifiably Robust Text Classification for Edit Distance (2024.findings-emnlp)
Copied to clipboard
| Challenge: | randomized smoothing has emerged as promising approach for certifying robustness to adversarial examples. |
| Approach: | They propose a method for certifying robustness to adversarial examples . they adapt Randomized Deletion and propose CERTified Edit Distance defense . |
| Outcome: | The proposed method outperforms existing methods in 4 out of 5 datasets in accuracy and cardinality. |
Assessing Robustness of Text Classification through Maximal Safe Radius Computation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Neural network NLP models are vulnerable to small modifications of the input that maintain the original meaning but result in a different prediction. |
| Approach: | They propose to provide a measure of robustness against word substitutions by computing a safe radius for a given input text. |
| Outcome: | The proposed methods are compared with LIME and CNN-Cert and show that they perform well on sentiment analysis and news classification models. |
Certified Robustness to Programmable Transformations in LSTMs (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing techniques for certifying robustness of LSTMs and extensions of lsts are prone to adversarial examples. |
| Approach: | They propose an approach to certify robustness of LSTMs and extensions of lstms . they show that their approach can train models more robust to combinations of string transformations - a key advantage of existing certification approaches . |
| Outcome: | The proposed approach can show high certification accuracy of the resulting models. |
Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation (D19-1)
Copied to clipboard
Po-Sen Huang, Robert Stanforth, Johannes Welbl, Chris Dyer, Dani Yogatama, Sven Gowal, Krishnamurthy Dvijotham, Pushmeet Kohli
| Challenge: | Recent work has exposed the vulnerabilities of neural NLP models, e.g. with small, semantically invariant input alterations. |
| Approach: | They propose to model text classification under synonym replacements or character flip perturbations and then use a formal model verification method to verify its robustness. |
| Outcome: | The proposed models show little difference in terms of nominal accuracy, but have much improved verified accuracy under perturbations and come with an efficiently computable formal guarantee on worst case adversaries. |
CR-UTP: Certified Robustness against Universal Text Perturbations on Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing certified robustness methods for certifying input-specific text perturbations have shown promise in certifyling UTPs, but masking only adversarial words can eliminate the attack. |
| Approach: | They propose a method to certify a language model’s robustness against UTPs by using random smoothing. |
| Outcome: | The proposed method achieves high certified accuracy under extensive masking and achieves state-of-the-art results in multiple settings. |
A Novel Metric for Measuring the Robustness of Large Language Models in Non-adversarial Scenarios (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Using large language models, we evaluated their robustness on multiple datasets. |
| Approach: | They propose a new metric for assessing model robustness by empirical evaluation of several models on multiple datasets. |
| Outcome: | The proposed metric is based on a set of datasets that are constructed by introducing naturally-occurring, non-malicious perturbations or by generating semantically equivalent paraphrases of input questions or statements. |
SAFER: A Structure-free Approach for Certified Robustness to Adversarial Word Substitutions (2020.acl-main)
Copied to clipboard
| Challenge: | State-of-the-art NLP models can be fooled by human-unaware transformations such as synonymous word substitution. |
| Approach: | They propose a method that constructs a stochastic ensemble by applying random word substitutions on the input sentences and leverages the statistical properties to provably certify the robustness. |
| Outcome: | The proposed method outperforms state-of-the-art methods on IMDB and Amazon text classification tasks with practically meaningful certified accuracy. |
On Robustness of Prompt-based Semantic Parsing with Large Pre-trained Language Model: An Empirical Study on Codex (2023.eacl-main)
Copied to clipboard
Terry Yue Zhuo, Zhuang Li, Yujin Huang, Fatemeh Shiri, Weiqing Wang, Gholamreza Haffari, Yuan-Fang Li
| Challenge: | Existing techniques for parsing natural-language utterances are vulnerable to adversarial attacks, requiring large amounts of labelled data and expensive human annotation. |
| Approach: | They propose to enhance the adversarial robustness of a prompt-based semantic parser based on a language model trained on code by constructing a set of demonstration examples. |
| Outcome: | The proposed method can be enhanced without significant amounts of labelled data or expensive human annotations on in-domain semantic parsing data. |
Robust AI-Generated Text Detection by Restricted Embeddings (2024.findings-emnlp)
Copied to clipboard
Kristian Kuznetsov, Eduard Tulchinskii, Laida Kushnareva, German Magai, Serguei Barannikov, Sergey Nikolenko, Irina Piontkovskaya
| Challenge: | Existing approaches for artificial text detection are score-based and classifier-based . however, score-driven methods often rely on a score-derived score. |
| Approach: | They investigate the ability of classifier-based detectors to transfer to unseen generators or semantic domains. |
| Outcome: | The proposed methods improve the out-of-distribution classification score by up to 9% and 14%. |
Bridging Robustness and Generalization Against Word Substitution Attacks in NLP via the Growth Bound Matrix Approach (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have shown that adversarial examples can alter models' predicted sentiment due to their sensitivity to specific word choices. |
| Approach: | They propose a regularization technique to improve NLP model robustness by reducing the impact of input perturbations on model outputs. |
| Outcome: | The proposed method outperforms state-of-the-art methods in adversarial defense. |