Offline Pseudo Relevance Feedback for Efficient and Effective Single-pass Dense Retrieval

August 20, 2023 ยท Entered Twilight ยท ๐Ÿ› Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

๐Ÿ’ค TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .gitignore, LICENSE, README.md, assets, conda.yaml, requirements.txt, source

Authors Xueru Wen, Xiaoyang Chen, Xuanang Chen, Ben He, Le Sun arXiv ID 2308.10191 Category cs.IR: Information Retrieval Citations 5 Venue Annual International ACM SIGIR Conference on Research and Development in Information Retrieval Repository https://github.com/Rosenberg37/OPRF โญ 5 Last Checked 1 month ago
Abstract
Dense retrieval has made significant advancements in information retrieval (IR) by achieving high levels of effectiveness while maintaining online efficiency during a single-pass retrieval process. However, the application of pseudo relevance feedback (PRF) to further enhance retrieval effectiveness results in a doubling of online latency. To address this challenge, this paper presents a single-pass dense retrieval framework that shifts the PRF process offline through the utilization of pre-generated pseudo-queries. As a result, online retrieval is reduced to a single matching with the pseudo-queries, hence providing faster online retrieval. The effectiveness of the proposed approach is evaluated on the standard TREC DL and HARD datasets, and the results demonstrate its promise. Our code is openly available at https://github.com/Rosenberg37/OPRF.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Retrieval