Reproducing HotFlip for Corpus Poisoning Attacks in Dense Retrieval
Not on the map. Why?
Abstract (arXiv)
HotFlip is a topical gradient-based word substitution method for attacking language models. Recently, this method has been further applied to attack retrieval systems by generating malicious passages that are injected into a corpus, i.e., corpus poisoning. However, HotFlip is known to be computationally inefficient, with the majority of time being spent on gradient accumulation for each query-passage pair during the adversarial token generation phase, making it impossible to generate an adequate number of adversarial passages in a reasonable amount of time. Moreover, the attack method itself assumes access to a set of user queries, a strong assumption that does not correspond to how real-world adversarial attacks are usually performed. In this paper, we first significantly boost the efficiency of HotFlip, reducing the adversarial generation process from 4 hours per document to only 15 minutes, using the same hardware. We further contribute experiments and analysis on two additional tasks: (1) transfer-based black-box attacks, and (2) query-agnostic attacks. Whenever possible, we provide comparisons between the original method and our improved version. Our experiments demonstrate that HotFlip can effectively attack a variety of dense retrievers, with an observed trend that its attack performance diminishes against more advanced and recent methods. Interestingly, we observe that while HotFlip performs poorly in a black-box setting, indicating limited capacity for generalization, in query-agnostic scenarios its performance is correlated to the volume of injected adversarial passages.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 27 of its 36 references that are in the map. First posted on arXiv 8 Jan 2025.
Builds on
27 of 36 references.
References · 27
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2013Intriguing properties of neural networkscited by 5,155
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
- 2016Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samplescited by 446
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
- 2023Poisoning Retrieval Corpora by Injecting Adversarial Passagescited by 159
- 2023How to Train Your DRAGON: Diverse Augmentation Towards Generalizable Dense Retrievalcited by 118
- 2019AllenNLP Interpret: A Framework for Explaining Predictions of NLP Modelscited by 74
15 more
- 2022PRADA: Practical Black-Box Adversarial Attacks against Neural Ranking Modelscited by 44
- 2020Adversarial Semantic Collisionscited by 42
- 2020Gradient-based Analysis of NLP Models is Manipulablecited by 41
- 2022Order-Disorder: Imitation Adversarial Attacks for Black-box Neural Ranking Modelscited by 37
- 2023Black-box Adversarial Attacks against Dense Retrieval Models: A Multi-view Contrastive Learning Methodcited by 29
- 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
- 2020One word at a time: adversarial attacks on retrieval modelscited by 23
- 2024Corpus Poisoning via Approximate Greedy Gradient Descentcited by 21
- 2023Topic-oriented Adversarial Attacks against Black-box Neural Ranking Modelscited by 18
- 2023Towards Imperceptible Document Manipulations against Neural Ranking Modelscited by 18
- 2021Text Counterfactuals via Latent Optimization and Shapley-Guided Searchcited by 16
- 2024Robust Neural Information Retrieval: An Adversarial and Out-of-distribution Perspectivecited by 15
- 2024Multi-granular Adversarial Attacks against Black-box Neural Ranking Modelscited by 14
- 2020Robustness to Programmable String Transformations via Augmented Abstract Trainingcited by 8
- 2024Robust Information Retrievalcited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 5.
7 papers.
- 2025Unsupervised Corpus Poisoning Attacks in Continuous Space for Dense Retrievalcited by 11
- 2025Rethinking the Privacy of Text Embeddings: A Reproducibility Study of "Text Embeddings Reveal (Almost) As Much As Text"cited by 6
- 2026On the Robustness of LLM-Based Dense Retrievers: A Systematic Analysis of Generalizability and Stabilitycited by 0
- 2026Lost in Decoding? Reproducing and Stress-Testing the Look-Ahead Prior in Generative Retrievalcited by 0
- 2026Hypencoder Revisited: Reproducibility and Analysis of Non-Linear Scoring for First-Stage Retrievalcited by 0
- 2026Led to Mislead: Adversarial Content Injection for Attacks on Neural Ranking Modelscited by 0
- 2026VerTox: Verifiable Reward-Guided Corpus Poisoning Against Neural Ranking Modelscited by 0
- 2026VerTox: Verifiable Reward-Guided Corpus Poisoning Against Neural Ranking Models1 Sep 2026
- 2026Led to Mislead: Adversarial Content Injection for Attacks on Neural Ranking Models2 May 2026
- 2026Hypencoder Revisited: Reproducibility and Analysis of Non-Linear Scoring for First-Stage Retrieval29 Apr 2026
- 2026Lost in Decoding? Reproducing and Stress-Testing the Look-Ahead Prior in Generative Retrieval25 Apr 2026
- 2026On the Robustness of LLM-Based Dense Retrievers: A Systematic Analysis of Generalizability and Stability17 Apr 2026
- 2025Rethinking the Privacy of Text Embeddings: A Reproducibility Study of "Text Embeddings Reveal (Almost) As Much As Text"10 Jul 2025
- 2025Unsupervised Corpus Poisoning Attacks in Continuous Space for Dense Retrieval24 Apr 2025