BERT Rankers are Brittle: a Study using Adversarial Document Perturbations
Contextual ranking models based on BERT are now well established for a wide range of passage and document ranking tasks. However, the robustness of BERT-based ranking models under adversarial inputs is under-explored. In this paper, we argue that BERT-rankers are not immune to adversarial attacks targeting retrieved documents given a query. Firstly, we propose algorithms for adversarial perturbation of both highly relevant and non-relevant documents using gradient-based optimization methods. The aim of our algorithms is to add/replace a small number of tokens to a highly relevant or non-relevant document to cause a large rank demotion or promotion. Our experiments show that a small number of tokens can already result in a large change in the rank of a document. Moreover, we find that BERT-rankers heavily rely on the document start/head for relevance prediction, making the initial part of the document more susceptible to adversarial attacks. More interestingly, we find a small set of recurring adversarial words that when added to documents result in successful rank demotion/promotion of any relevant/non-relevant document respectively. Finally, our adversarial tokens also show particular topic preferences within and across datasets, exposing potential biases from BERT pre-training or downstream datasets.
Code (1)
Tasks
Document RankingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Study on FGSM Adversarial Training for Neural Retrieval
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 vulnerab…
Data AugmentationRetrievalOn the Calibration and Uncertainty of Neural Learning to Rank Models
According to the Probability Ranking Principle (PRP), ranking documents in decreasing order of their probability of relevance leads to an optimal document ranking for ad-hoc retrieval. The PRP holds when two conditions a…
Document RankingLearning-To-RankRetrievalImproving Bi-encoder Document Ranking Models with Two Rankers and Multi-teacher Distillation
BERT-based Neural Ranking Models (NRMs) can be classified according to how the query and document are encoded through BERT's self-attention layers - bi-encoder versus cross-encoder. Bi-encoder models are highly efficient…
Document RankingOn the Calibration and Uncertainty of Neural Learning to Rank Models for Conversational Search
According to the Probability Ranking Principle (PRP), ranking documents in decreasing order of their probability of relevance leads to an optimal document ranking for ad-hoc retrieval. The PRP holds when two conditions a…
Conversational SearchDocument RankingLearning-To-RankRetrievalBERT meets Cranfield: Uncovering the Properties of Full Ranking on Fully Labeled Data
Recently, various information retrieval models have been proposed based on pre-trained BERT models, achieving outstanding performance. The majority of such models have been tested on data collections with partial relevan…
Information RetrievalRetrieval