Are Neural Ranking Models Robust?

Author:

Wu Chen1ORCID,Zhang Ruqing1ORCID,Guo Jiafeng1ORCID,Fan Yixing1ORCID,Cheng Xueqi1ORCID

Affiliation:

1. CAS Key Lab of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China; University of Chinese Academy of Sciences, Beijing, China

Abstract

Recently, we have witnessed the bloom of neural ranking models in the information retrieval (IR) field. So far, much effort has been devoted to developing effective neural ranking models that can generalize well on new data. There has been less attention paid to the robustness perspective. Unlike the effectiveness, which is about the average performance of a system under normal purpose, robustness cares more about the system performance in the worst case or under malicious operations instead. When a new technique enters into the real-world application, it is critical to know not only how it works in average, but also how would it behave in abnormal situations. So, we raise the question in this work: Are neural ranking models robust? To answer this question, first, we need to clarify what we refer to when we talk about the robustness of ranking models in IR. We show that robustness is actually a multi-dimensional concept and there are three ways to define it in IR: (1) the performance variance under the independent and identically distributed (I.I.D.) setting; (2) the out-of-distribution (OOD) generalizability ; and (3) the defensive ability against adversarial operations. The latter two definitions can be further specified into two different perspectives, respectively, leading to five robustness tasks in total. Based on this taxonomy, we build corresponding benchmark datasets, design empirical experiments, and systematically analyze the robustness of several representative neural ranking models against traditional probabilistic ranking models and learning-to-rank (LTR) models. The empirical results show that there is no simple answer to our question. While neural ranking models are less robust against other IR models in most cases, some of them can still win two out of five tasks. This is the first comprehensive study on the robustness of neural ranking models. We believe the way we study the robustness as well as our findings would be beneficial to the IR community. We will also release all the data and codes to facilitate the future research in this direction.

Funder

National Natural Science Foundation of China

Youth Innovation Promotion Association CAS

Lenovo-CAS Joint Lab Youth Scientist Project

Foundation and Frontier Research Key Program of Chongqing Science and Technology Commission

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,General Business, Management and Accounting,Information Systems

Reference104 articles.

1. DocBERT: BERT for document classification;Adhikari Ashutosh;arXiv preprint arXiv:1904.08398,2019

2. Learning a spelling error model from search query logs

3. Threat of Adversarial Attacks on Deep Learning in Computer Vision: A Survey

4. Generating Natural Language Adversarial Examples

5. Andrei Broder. 2002. A taxonomy of web search. In ACM Sigir Forum, Vol. 36. ACM New York, NY, 3–10.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Purely Entity-Based Semantic Search Approach for Document Retrieval;Applied Sciences;2023-09-14

2. Topic-oriented Adversarial Attacks against Black-box Neural Ranking Models;Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval;2023-07-18

3. PRADA: Practical Black-box Adversarial Attacks against Neural Ranking Models;ACM Transactions on Information Systems;2023-04-08

4. Content-Based Relevance Estimation in Retrieval Settings with Ranking-Incentivized Document Manipulations;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3