Relevance-based embeddings for efficient relevance retrieval

Kirill Sergeevich Shevkunov, Andrey Ploskonosov, Liudmila Prokhorenkova

Primary Area: unsupervised, self-supervised, semi-supervised, and supervised representation learning

Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.

Keywords: Information search, Relevance search, Nearest neighbor search, Relevance-based embeddings, Recommendation systems

Submission Guidelines: I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2024/AuthorGuide.

Abstract: In many machine learning applications, the most relevant items for a particular query should be efficiently extracted. The relevance function is typically an expensive neural similarity model making the exhaustive search infeasible. A typical solution to this problem is to train another model that separately embeds queries and items to a vector space, where similarity is defined via the dot product or cosine similarity. This allows one to search the most relevant objects through fast approximate nearest neighbors search at the cost of some reduction in quality. To compensate for this reduction, the found candidates are then re-ranked by the expensive similarity model. In this paper, we propose an alternative approach that utilizes the relevances of the expensive model to make relevance-based embeddings. We show both theoretically and empirically that describing each query by its relevance for a set of support items creates a powerful query representation. Additionally, we investigate several strategies for selecting these support items and show that additional significant improvements can be obtained. Our experiments on diverse datasets show improved performance over existing approaches.

Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors' identity.

No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.

Submission Number: 7660