Challenge: Pretrained language models are susceptible to subtle perturbations and require multiple adversarial training during fine-tuning to improve their robustness.
Approach: They propose a novel adversarial defense method ORTicket that fine-tunes a model for downstream tasks.
Outcome: The proposed method achieves comparable robustness to other defense methods while maintaining the efficiency of fine-tuning.

Similar Papers

Learning to Win Lottery Tickets in BERT Transfer via Task-agnostic Mask Training (2022.naacl-main)

Copied to clipboard

Challenge: Recent studies show pre-trained language models contain matching subnetworks that have similar transfer learning performance as the original PLM.
Approach: They propose to prune matching subnetworks using magnitude-based pruning . they propose to optimize the subnetwork structure towards the pre-training objectives .
Outcome: The proposed method is more efficient in searching subnetworks and advantageous when fine-tuning within a range of data scarcity.
Efficient Adversarial Training with Robust Early-Bird Tickets (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to improve the robustness of pre-trained language models are expensive because of the need to generate adversarial examples via gradient descent.
Approach: They propose an adversarial optimization method that searches for robust tickets with structured sparsity in the early stage and fine-tunes tickets in the remaining time.
Outcome: The proposed method achieves up to 7 13 training speedups while maintaining comparable or even better robustness compared to the most competitive state-of-the-art methods.
Robust Lottery Tickets for Pre-trained Language Models (2022.acl-long)

Copied to clipboard

Challenge: Recent studies have shown that pre-trained language models contain smaller matching subnetworks that are not robust to adversarial examples.
Approach: They propose a method to find robust tickets hidden in pre-trained language models by learning binary weight masks and an adversarial loss objective to guide the search.
Outcome: The proposed method improves on previous work on adversarial robustness evaluation.
Robust Transfer Learning with Pretrained Language Models through Adapters (2021.acl-short)

Copied to clipboard

Challenge: Existing approaches to transfer learning with pretrained transformer-based language models are not robust and can be adversarial.
Approach: They propose a simple yet effective adapter-based approach to fine-tune language models on downstream tasks.
Outcome: The proposed approach improves stability and adversarial robustness in transfer learning to various downstream tasks.
Model Extraction and Adversarial Transferability, Your BERT is Vulnerable! (2021.naacl-main)

Copied to clipboard

Challenge: Pretrained language models are used for natural language processing (NLP) but when they are deployed as a service, they can suffer from different attacks .
Approach: They propose two defence strategies to protect the target model from adversarial attacks . they show that model extraction and adversarially transferable attacks can be effective .
Outcome: The extracted model can lead to highly transferable adversarial attacks against the target model.
Flooding-X: Improving BERT’s Resistance to Adversarial Attacks via Loss-Restricted Fine-Tuning (2022.acl-long)

Copied to clipboard

Challenge: Existing approaches to generating adversarial perturbations scale up the cost of training computational complexity by the number of gradient steps it takes to obtain the adversarials.
Approach: They propose a flood method which aims at better generalization and a criterion to bring hyper-parameter-dependent flooding into effect with a narrowed-down search space by measuring how the gradient steps taken within one epoch affect the loss of each batch.
Outcome: The proposed method improves BERT’s resistance to textual adversarial attacks by a large margin and achieves state-of-the-art robust accuracy on various text classification and GLUE tasks.
Pruning Unsafe Tickets: A Resource-Efficient Framework for Safer and More Robust LLMs (2026.acl-long)

Copied to clipboard

Challenge: Empirical evaluations on ML models show substantial reductions in unsafe generations and improved robustness against jailbreak attacks.
Approach: They propose a resource-efficient pruning framework that directly identifies unsafe behaviors while preserving model utility.
Outcome: The proposed framework reduces unsafe generations and improves robustness against jailbreak attacks with minimal utility loss.
ROSE: Robust Selective Fine-tuning for Pre-trained Language Models (2022.emnlp-main)

Copied to clipboard

Challenge: Recent studies have highlighted the lack of adversarial robustness in pre-trained models.
Approach: They propose a fine-tuning approach that conducts selective updates when adapting pre-trained models to downstream tasks.
Outcome: The proposed approach improves adversarial robustness on downstream tasks . it eliminates spurious updates, leading to flatter and wider optima than the conventional method .
PlugAT: A Plug and Play Module to Defend against Textual Adversarial Attack (2022.coling-1)

Copied to clipboard

Challenge: Recent studies have shown that adversarial examples can be easily fooled by adversarially perturbed examples.
Approach: They propose a pluggable defense module PlugAT to provide robust predictions by adding a few trainable parameters to the model inputs while keeping the original model frozen.
Outcome: The proposed model improves robustness over several strong baselines whilst training only 9.1% parameters.
SemRoDe: Macro Adversarial Training to Learn Representations that are Robust to Word-Level Attacks (2024.naacl-long)

Copied to clipboard

Challenge: Existing approaches to defend against word-level attacks have been limited.
Approach: They propose a new approach called Semantic Robust Defence to enhance the robustness of language models by aligning the domains with a distance-based objective.
Outcome: The proposed approach can be generalized across word embeddings, even when they share minimal overlap at both vocabulary and word-substitution levels.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations