mlsanityData to 7 Oct 2026

MINIMAL: Mining Models for Data Free Universal Adversarial Triggers

arXiv 2109.12406 ↗First posted 25 Sep 2021cs.CL cs.AI cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

It is well known that natural language models are vulnerable to adversarial attacks, which are mostly input-specific in nature. Recently, it has been shown that there also exist input-agnostic attacks in NLP models, called universal adversarial triggers. However, existing methods to craft universal triggers are data intensive. They require large amounts of data samples to generate adversarial triggers, which are typically inaccessible by attackers. For instance, previous works take 3000 data samples per class for the SNLI dataset to generate adversarial triggers. In this paper, we present a novel data-free approach, MINIMAL, to mine input-agnostic adversarial triggers from models. Using the triggers produced with our data-free algorithm, we reduce the accuracy of Stanford Sentiment Treebank's positive class from 93.6% to 9.6%. Similarly, for the Stanford Natural Language Inference (SNLI), our single-word trigger reduces the accuracy of the entailment class from 90.95% to less than 0.6%. Despite being completely data-free, we get equivalent accuracy drops as data-dependent methods.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 27 of its 40 references that are in the map. First posted on arXiv 25 Sep 2021.

Builds on

27 of 40 references.

References · 27

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  3. 2018Deep contextualized word representationscited by 2,285
  4. 2015A large annotated corpus for learning natural language inferencecited by 1,837
  5. 2016Universal adversarial perturbationscited by 774
  6. 2019Universal Adversarial Triggers for Attacking and Analyzing NLPcited by 709
  7. 2018Annotation Artifacts in Natural Language Inference Datacited by 656
  8. 2016Stealing Machine Learning Models via Prediction APIscited by 602
  9. 2018Hypothesis Only Baselines in Natural Language Inferencecited by 291
  10. 2016A Decomposable Attention Model for Natural Language Inferencecited by 214
  11. 2017Advances in Pre-Training Distributed Word Representationscited by 207
  12. 2016Enhanced LSTM for Natural Language Inferencecited by 199
15 more
  1. 2018Deep Learning for Sentiment Analysis : A Surveycited by 139
  2. 2019Zero-shot Knowledge Transfer via Adversarial Belief Matchingcited by 129
  3. 2019Zero-Shot Knowledge Distillation in Deep Networkscited by 119
  4. 2017Deep Keyphrase Generationcited by 102
  5. 2018Generalizable Data-free Objective for Crafting Universal Adversarial Perturbationscited by 88
  6. 2017Fast Feature Fool: A data independent approach to universal adversarial perturbationscited by 65
  7. 2021A Survey On Universal Adversarial Attackcited by 59
  8. 2019On Evaluation of Adversarial Perturbations for Sequence-to-Sequence Modelscited by 56
  9. 2020Universal Adversarial Attacks with Natural Triggers for Text Classificationcited by 50
  10. 2016Dynamic Coattention Networks For Question Answeringcited by 49
  11. 2017Art of singular vectors and universal adversarial perturbationscited by 49
  12. 2018Ask, Acquire, and Attack: Data-free UAP Generation using Class Impressionscited by 31
  13. 2018Universal Perturbation Attack Against Image Retrievalcited by 31
  14. 2020Get It Scored Using AutoSAS -- An Automated System for Scoring Short Answerscited by 18
  15. 2020Data-Free Adversarial Perturbations for Practical Black-Box Attackcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 2.

4 papers.