DSRM: Boost Textual Adversarial Training with Distribution Shift Risk Minimization
Not on the map. Why?
Abstract (arXiv)
Adversarial training is one of the best-performing methods in improving the robustness of deep language models. However, robust models come at the cost of high time consumption, as they require multi-step gradient ascents or word substitutions to obtain adversarial samples. In addition, these generated samples are deficient in grammatical quality and semantic consistency, which impairs the effectiveness of adversarial training. To address these problems, we introduce a novel, effective procedure for instead adversarial training with only clean data. Our procedure, distribution shift risk minimization (DSRM), estimates the adversarial loss by perturbing the input data's probability distribution rather than their embeddings. This formulation results in a robust model that minimizes the expected global loss under adversarial attacks. Our approach requires zero adversarial samples for training and reduces time consumption by up to 70% compared to current best-performing adversarial training methods. Experiments demonstrate that DSRM considerably improves BERT's resistance to textual adversarial attacks and achieves state-of-the-art robust accuracy on various benchmarks.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 31 of its 48 references that are in the map. First posted on arXiv 27 Jun 2023.
Builds on
31 of 48 references.
References · 31
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2020Fast is better than free: Revisiting adversarial trainingcited by 727
- 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 671
- 2019Adversarial Training for Free!cited by 643
- 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 491
- 2018TextBugger: Generating Adversarial Text Against Real-world Applicationscited by 381
19 more
- 2020Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examplescited by 278
- 2019FreeLB: Enhanced Adversarial Training for Natural Language Understandingcited by 264
- 2018Adversarial Risk and the Dangers of Evaluating Against Weak Attackscited by 221
- 2020Understanding and Improving Fast Adversarial Trainingcited by 214
- 2019You Only Propagate Once: Accelerating Adversarial Training via Maximal Principlecited by 183
- 2021On the Convergence and Robustness of Adversarial Trainingcited by 130
- 2020InfoBERT: Improving Robustness of Language Models from An Information Theoretic Perspectivecited by 92
- 2020OpenAttack: An Open-source Textual Adversarial Attack Toolkitcited by 84
- 2020AdvAug: Robust Adversarial Augmentation for Neural Machine Translationcited by 67
- 2020Do We Need Zero Training Loss After Achieving Zero Training Error?cited by 61
- 2021Searching for an Effective Defender: Benchmarking Defense against Adversarial Word Substitutioncited by 56
- 2020Better Robustness by More Coverage: Adversarial Training with Mixup Augmentation for Robust Fine-tuningcited by 39
- 2021Using Adversarial Attacks to Reveal the Statistical Bias in Machine Reading Comprehension Modelscited by 29
- 2022A Survey of Adversarial Defences and Robustness in NLPcited by 23
- 2019Detecting Overfitting via Adversarial Examplescited by 15
- 2021BERT is Robust! A Case Against Synonym-Based Adversarial Examples in Text Classificationcited by 9
- 2022Efficient Adversarial Training with Robust Early-Bird Ticketscited by 5
- 2022Improving robustness of language models from a geometry-aware perspectivecited by 4
- 2022Distinguishing Non-natural from Natural Adversarial Samples for More Robust Pre-trained Language Modelcited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 3; 2026: 1.
7 papers.
- 2025Towards the Worst-case Robustness of Large Language Modelscited by 7
- 2024SemRoDe: Macro Adversarial Training to Learn Representations That are Robust to Word-Level Attackscited by 3
- 2025Adversarial Defence without Adversarial Defence: Enhancing Language Model Robustness via Instance-level Principal Component Removalcited by 2
- 2023Fooling the Textual Fooler via Randomizing Latent Representationscited by 1
- 2024DiffuseDef: Improved Robustness to Adversarial Attacks via Iterative Denoisingcited by 1
- 2025Breaking the Adversarial Robustness-Performance Trade-off in Text Classification via Manifold Purificationcited by 0
- 2026Hybrid Adversarial Defence for Natural Language Understanding Taskscited by 0
- 2026Hybrid Adversarial Defence for Natural Language Understanding Tasks3 Jun 2026
- 2025Breaking the Adversarial Robustness-Performance Trade-off in Text Classification via Manifold Purification11 Nov 2025
- 2025Adversarial Defence without Adversarial Defence: Enhancing Language Model Robustness via Instance-level Principal Component Removal29 Jul 2025
- 2025Towards the Worst-case Robustness of Large Language Models31 Jan 2025
- 2024DiffuseDef: Improved Robustness to Adversarial Attacks via Iterative Denoising28 Jun 2024
- 2024SemRoDe: Macro Adversarial Training to Learn Representations That are Robust to Word-Level Attacks27 Mar 2024
- 2023Fooling the Textual Fooler via Randomizing Latent Representations2 Oct 2023