Evaluating the Suitability of Interpolation-Based Re-ranking For Ad-Hoc Retrieval
L. Navarčíková (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Jurek Leonhardt – Mentor (L3S)
Avishek Anand – Mentor (Leibniz Universität)
A Hanjalic – Graduation committee member (TU Delft - Intelligent Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Interpolation-based re-ranking emerged to make dense retrieval possible in low-latency applications such as web engine search. However, to this day there is no clear winner among the different ranking approaches. Moreover, missing document scores in hybrid retrieval have not been investigated in detail. This paper aims to address this by comparing the interpolation-based re-ranking with dense and hybrid retrieval approaches in terms of ranking performance and latency. It goes to show that while interpolation-based re-ranking has a notable latency advantage, hybrid retrieval achieves best performance in ranking metrics for an in-domain setting. Additionally, differences in missing document score techniques are slight with zero imputation emerging on top.