Enhance Robustness of Language Models Against Variation Attack through Graph Integration
Not on the map. Why?
Abstract (arXiv)
The widespread use of pre-trained language models (PLMs) in natural language processing (NLP) has greatly improved performance outcomes. However, these models' vulnerability to adversarial attacks (e.g., camouflaged hints from drug dealers), particularly in the Chinese language with its rich character diversity/variation and complex structures, hatches vital apprehension. In this study, we propose a novel method, CHinese vAriatioN Graph Enhancement (CHANGE), to increase the robustness of PLMs against character variation attacks in Chinese content. CHANGE presents a novel approach for incorporating a Chinese character variation graph into the PLMs. Through designing different supplementary tasks utilizing the graph structure, CHANGE essentially enhances PLMs' interpretation of adversarially manipulated text. Experiments conducted in a multitude of NLP tasks show that CHANGE outperforms current language models in combating against adversarial attacks and serves as a valuable contribution to robust language model research. These findings contribute to the groundwork on robust language models and highlight the substantial potential of graph-guided pre-training strategies for real-world applications.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 44 references that are in the map. First posted on arXiv 18 Apr 2024.
Builds on
27 of 44 references.
References · 27
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2013Intriguing properties of neural networkscited by 5,114
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2019ERNIE: Enhanced Language Representation with Informative Entitiescited by 525
- 2019How to Fine-Tune BERT for Text Classification?cited by 409
- 2018TextBugger: Generating Adversarial Text Against Real-world Applicationscited by 376
- 2019KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representationcited by 356
- 2020BAE: BERT-based Adversarial Examples for Text Classificationcited by 316
- 2019K-BERT: Enabling Language Representation with Knowledge Graphcited by 303
- 2020Revisiting Pre-Trained Models for Chinese Natural Language Processingcited by 262
- 2021R-Drop: Regularized Dropout for Neural Networkscited by 202
15 more
- 2015Yara Parser: A Fast and Accurate Dependency Parsercited by 110
- 2020SSMBA: Self-Supervised Manifold Based Data Augmentation for Improving Out-of-Domain Robustnesscited by 94
- 2020Spelling Error Correction with Soft-Masked BERTcited by 90
- 2020CoLAKE: Contextualized Language and Knowledge Embeddingcited by 86
- 2021ChineseBERT: Chinese Pretraining Enhanced by Glyph and Pinyin Informationcited by 65
- 2020SpellGCN: Incorporating Phonological and Visual Similarities into Language Models for Chinese Spelling Checkcited by 57
- 2022PRADA: Practical Black-Box Adversarial Attacks against Neural Ranking Modelscited by 44
- 2020CAT-Gen: Improving Robustness in NLP Models via Controlled Adversarial Text Generationcited by 43
- 2020Better Robustness by More Coverage: Adversarial Training with Mixup Augmentation for Robust Fine-tuningcited by 39
- 2022Order-Disorder: Imitation Adversarial Attacks for Black-box Neural Ranking Modelscited by 37
- 2021Defending Pre-trained Language Models from Adversarial Word Substitutions Without Performance Sacrificecited by 30
- 2021Lattice-BERT: Leveraging Multi-Granularity Representations in Chinese Pre-trained Language Modelscited by 19
- 2018Neural Lattice Language Modelscited by 13
- 2019Detect Camouflaged Spam Content via StoneSkipping: Graph and Text Joint Embedding for Chinese Character Variation Representationcited by 7
- 2021Enhancing Model Robustness By Incorporating Adversarial Knowledge Into Semantic Representationcited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.