arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2305.09574cs.CLcs.AIcs.CR
收藏

UOR:针对预训练语言模型的通用后门攻击

UOR: Universal Backdoor Attacks on Pre-trained Language Models

Shanghai Jiao Tong University(上海交通大学);School of Cyber Science and Engineering(网络安全学院)

Wei Du, Peixuan Li, Boqun Li, Haodong Zhao, Gongshen Liu

AI总结:

本文提出名为UOR的通用后门攻击方法,通过中毒监督对比学习自动优化触发器输出表示,并利用梯度搜索自适应选择触发词,在多种PLMs和任务上实现了更优的攻击性能与通用性。

摘要:

植入预训练语言模型(PLMs)的后门可以转移到各种下游任务中,这暴露了严重的安全威胁。然而,现有针对PLMs的大多数后门攻击都是无目标且特定于任务的。少数与任务无关的有目标方法使用手动预定义的触发器和输出表示,这阻碍了攻击变得更有效和通用。在本文中,我们首先总结了针对PLMs的更具威胁性的后门攻击应满足的要求,然后提出了一种名为UOR的新后门攻击方法,该方法通过将手动选择转变为自动优化,打破了先前方法的瓶颈。具体而言,我们定义了中毒监督对比学习,它可以自动学习适用于各种PLMs的更统一和通用的触发器输出表示。此外,我们使用梯度搜索来选择能够适应不同PLMs和词汇表的合适触发词。实验表明,与手动方法相比,我们的方法在各种文本分类任务上能实现更好的攻击性能。此外,我们在具有不同架构、不同使用范式和更困难任务的PLMs上测试了我们的方法,这证明了我们方法的通用性。

英文摘要:

Backdoors implanted in pre-trained language models (PLMs) can be transferred to various downstream tasks, which exposes a severe security threat. However, most existing backdoor attacks against PLMs are un-targeted and task-specific. Few targeted and task-agnostic methods use manually pre-defined triggers and output representations, which prevent the attacks from being more effective and general. In this paper, we first summarize the requirements that a more threatening backdoor attack against PLMs should satisfy, and then propose a new backdoor attack method called UOR, which breaks the bottleneck of the previous approach by turning manual selection into automatic optimization. Specifically, we define poisoned supervised contrastive learning which can automatically learn the more uniform and universal output representations of triggers for various PLMs. Moreover, we use gradient search to select appropriate trigger words which can be adaptive to different PLMs and vocabularies. Experiments show that our method can achieve better attack performance on various text classification tasks compared to manual methods. Further, we tested our method on PLMs with different architectures, different usage paradigms, and more difficult tasks, which demonstrated the universality of our method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑