mlsanityData to 7 Oct 2026

Improving robustness of language models from a geometry-aware perspective

arXiv 2204.13309 ↗First posted 28 Apr 2022cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

Recent studies have found that removing the norm-bounded projection and increasing search steps in adversarial training can significantly improve robustness. However, we observe that a too large number of search steps can hurt accuracy. We aim to obtain strong robustness efficiently using fewer steps. Through a toy experiment, we find that perturbing the clean data to the decision boundary but not crossing it does not degrade the test accuracy. Inspired by this, we propose friendly adversarial data augmentation (FADA) to generate friendly adversarial data. On top of FADA, we propose geometry-aware adversarial training (GAT) to perform adversarial training on friendly adversarial data so that we can save a large number of search steps. Comprehensive experiments across two widely used datasets and three pre-trained language models demonstrate that GAT can obtain stronger robustness via fewer steps. In addition, we provide extensive empirical results and in-depth analyses on robustness to facilitate future studies.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 29 of its 47 references that are in the map. First posted on arXiv 28 Apr 2022.

Builds on

29 of 47 references.

References · 29

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  5. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  6. 2013Intriguing properties of neural networkscited by 5,114
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  8. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  9. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  10. 2014Convolutional Neural Networks for Sentence Classificationcited by 1,124
  11. 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 663
  12. 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 488
17 more
  1. 2018TextBugger: Generating Adversarial Text Against Real-world Applicationscited by 376
  2. 2020BAE: BERT-based Adversarial Examples for Text Classificationcited by 316
  3. 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
  4. 2019FreeLB: Enhanced Adversarial Training for Natural Language Understandingcited by 261
  5. 2020Attacks Which Do Not Kill Training Make Adversarial Learning Strongercited by 242
  6. 2020Geometry-aware Instance-reweighted Adversarial Trainingcited by 198
  7. 2019Certified Robustness to Adversarial Word Substitutionscited by 164
  8. 2017Deep Text Classification Can be Fooledcited by 105
  9. 2016Crafting Adversarial Input Sequences for Recurrent Neural Networkscited by 102
  10. 2020InfoBERT: Improving Robustness of Language Models from An Information Theoretic Perspectivecited by 92
  11. 2020SAFER: A Structure-free Approach for Certified Robustness to Adversarial Word Substitutionscited by 72
  12. 2021Towards Robustness Against Natural Language Word Substitutionscited by 68
  13. 2018Interpretable Adversarial Perturbation in Input Embedding Space for Textcited by 67
  14. 2020Do We Need Zero Training Loss After Achieving Zero Training Error?cited by 61
  15. 2020Robust Encodings: A Framework for Combating Adversarial Typoscited by 58
  16. 2021Searching for an Effective Defender: Benchmarking Defense against Adversarial Word Substitutioncited by 55
  17. 2020Better Robustness by More Coverage: Adversarial Training with Mixup Augmentation for Robust Fine-tuningcited by 39

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1.

4 papers.