Randomized Smoothing with Masked Inference for Adversarially Robust Text Classifications
Han Cheol Moon, Shafiq Joty, Ruochen Zhao, Megh Thakkar, Chi Xu
Abstract
Large-scale pre-trained language models have shown outstanding performance in a variety of NLP tasks. However, they are also known to be significantly brittle against specifically crafted adversarial examples, leading to increasing interest in probing the adversarial robustness of NLP systems. We introduce RSMI, a novel two-stage framework that combines randomized smoothing (RS) with masked inference (MI) to improve the adversarial robustness of NLP systems. RS transforms a classifier into a smoothed classifier to obtain robust representations, whereas MI forces a model to exploit the surrounding context of a masked token in an input sequence. RSMI improves adversarial robustness by 2 to 3 times over existing state-of-the-art methods on benchmark datasets. We also perform in-depth qualitative analysis to validate the effectiveness of the different stages of RSMI and probe the impact of its components through extensive ablations. By empirically proving the stability of RSMI, we put it forward as a practical method to robustly train large-scale NLP models. Our code and datasets are available at https://github.com/Han8931/rsmi_nlp
BibTeX
@inproceedings{moon-etal-2023-randomized,
title = "Randomized Smoothing with Masked Inference for Adversarially Robust Text Classifications",
author = "Moon, Han Cheol and
Joty, Shafiq and
Zhao, Ruochen and
Thakkar, Megh and
Xu, Chi",
editor = "Rogers, Anna and
Boyd-Graber, Jordan and
Okazaki, Naoaki",
booktitle = "Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)",
month = jul,
year = "2023",
address = "Toronto, Canada",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2023.acl-long.282/",
doi = "10.18653/v1/2023.acl-long.282",
pages = "5145--5165"
}