mlsanityData to 7 Oct 2026

A Study on FGSM Adversarial Training for Neural Retrieval

arXiv 2301.10576 ↗First posted 25 Jan 2023cs.IR cs.CLcited by 10

Not on the map. Why?

Abstract (arXiv)

Neural retrieval models have acquired significant effectiveness gains over the last few years compared to term-based methods. Nevertheless, those models may be brittle when faced to typos, distribution shifts or vulnerable to malicious attacks. For instance, several recent papers demonstrated that such variations severely impacted models performances, and then tried to train more resilient models. Usual approaches include synonyms replacements or typos injections -- as data-augmentation -- and the use of more robust tokenizers (characterBERT, BPE-dropout). To further complement the literature, we investigate in this paper adversarial training as another possible solution to this robustness issue. Our comparison includes the two main families of BERT-based neural retrievers, i.e. dense and sparse, with and without distillation techniques. We then demonstrate that one of the most simple adversarial training techniques -- the Fast Gradient Sign Method (FGSM) -- can improve first stage rankers robustness and effectiveness. In particular, FGSM increases models performances on both in-domain and out-of-domain distributions, and also on queries with typos, for multiple neural retrievers.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 26 of its 29 references that are in the map. First posted on arXiv 25 Jan 2023.

Builds on

26 of 29 references.

References · 26

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  4. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  5. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  6. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  7. 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
  8. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  9. 2016Universal adversarial perturbationscited by 774
  10. 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 488
  11. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
  12. 2021Poisoning and Backdooring Contrastive Learningcited by 149
14 more
  1. 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
  2. 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
  3. 2022From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effectivecited by 98
  4. 2022PRADA: Practical Black-Box Adversarial Attacks against Neural Ranking Modelscited by 44
  5. 2022Anticorrelated Noise Injection for Improved Generalizationcited by 41
  6. 2022Order-Disorder: Imitation Adversarial Attacks for Black-box Neural Ranking Modelscited by 37
  7. 2021Evaluating the Robustness of Retrieval Pipelines with Query Variation Generatorscited by 33
  8. 2020Universal Adversarial Perturbations: A Surveycited by 28
  9. 2021Dealing with Typos for BERT-based Passage Retrieval and Rankingcited by 23
  10. 2022Analysing the Robustness of Dual Encoders for Dense Retrieval Against Misspellingscited by 23
  11. 2022CharacterBERT and Self-Teaching for Improving the Robustness of Dense Retrievers on Queries with Typoscited by 22
  12. 2022BERT Rankers are Brittle: a Study using Adversarial Document Perturbationscited by 16
  13. 2021Contrastive Fine-tuning Improves Robustness for Neural Rankerscited by 12
  14. 2022Certified Robustness to Word Substitution Ranking Attack for Neural Ranking Modelscited by 11

Built on by

Cited by year (2026 to 7 Oct)

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

10 papers.