Affiliation:
1. [0]Gaoling School of Artificial Intelligence Renmin University of China, China
2. Baidu Inc., China
3. [0]Gaoling School of Artificial Intelligence [1]School of Information Renmin University of China, China
Abstract
Text retrieval is a long-standing research topic on information seeking, where a system is required to return relevant information resources to user’s queries in natural language. From heuristic-based retrieval methods to learning-based ranking functions, the underlying retrieval models have been continually evolved with the ever-lasting technical innovation. To design effective retrieval models, a key point lies in how to learn text representations and model the relevance matching. The recent success of pretrained language models (PLM) sheds light on developing more capable text retrieval approaches by leveraging the excellent modeling capacity of PLMs. With powerful PLMs, we can effectively learn the semantic representations of queries and texts in the latent representation space, and further construct the semantic matching function between the dense vectors for relevance modeling. Such a retrieval approach is called
dense retrieval
, since it employs dense vectors to represent the texts. Considering the rapid progress on dense retrieval, this survey systematically reviews the recent progress on PLM-based dense retrieval. Different from previous surveys on dense retrieval, we take a new perspective to organize the related studies by four major aspects, including architecture, training, indexing and integration, and thoroughly summarize the mainstream techniques for each aspect. We extensively collect the recent advances on this topic, and include 300+ reference papers. To support our survey, we create a website for providing useful resources, and release a code repository for dense retrieval. This survey aims to provide a comprehensive, practical reference focused on the major progress for dense text retrieval.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,General Business, Management and Accounting,Information Systems
Reference337 articles.
1. An information-theoretic perspective of tf–idf measures
2. Chris Alberti , Daniel Andor , Emily Pitler , Jacob Devlin , and Michael Collins . 2019 . Synthetic QA Corpora Generation with Roundtrip Consistency . In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics. 6168–6173 . Chris Alberti, Daniel Andor, Emily Pitler, Jacob Devlin, and Michael Collins. 2019. Synthetic QA Corpora Generation with Roundtrip Consistency. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics. 6168–6173.
3. Negar Arabzadeh , Bhaskar Mitra , and Ebrahim Bagheri . 2021 . MS MARCO Chameleons: Challenging the MS MARCO Leaderboard with Extremely Obstinate Queries . In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 4426–4435 . Negar Arabzadeh, Bhaskar Mitra, and Ebrahim Bagheri. 2021. MS MARCO Chameleons: Challenging the MS MARCO Leaderboard with Extremely Obstinate Queries. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 4426–4435.
4. Negar Arabzadeh Alexandra Vtyurina Xinyi Yan and Charles LA Clarke. 2021. Shallow pooling for sparse labels. arXiv preprint arXiv:2109.00062(2021). Negar Arabzadeh Alexandra Vtyurina Xinyi Yan and Charles LA Clarke. 2021. Shallow pooling for sparse labels. arXiv preprint arXiv:2109.00062(2021).
5. Negar Arabzadeh Xinyi Yan and Charles LA Clarke. 2021. Predicting Efficiency/Effectiveness Trade-offs for Dense vs. Sparse Retrieval Strategy Selection. arXiv preprint arXiv:2109.10739(2021). Negar Arabzadeh Xinyi Yan and Charles LA Clarke. 2021. Predicting Efficiency/Effectiveness Trade-offs for Dense vs. Sparse Retrieval Strategy Selection. arXiv preprint arXiv:2109.10739(2021).
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献