HackerPapers

arXiv:2304.09542cs.CL

Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents

Weiwei Sun, Lingyong Yan, Xinyu Ma, Shuaiqiang Wang, Pengjie Ren, Zhumin Chen, Dawei Yin, Zhaochun Ren

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Large Language Models (LLMs) have demonstrated remarkable zero-shot generalization across various language-related tasks, including search engines. However, existing work utilizes the generative ability of LLMs for Information Retrieval (IR) rather than direct passage ranking. The discrepancy between the pre-training objectives of LLMs and the ranking objective poses another challenge. In this paper, we first investigate generative LLMs such as ChatGPT and GPT-4 for relevance ranking in IR. Surprisingly, our experiments reveal that properly instructed LLMs can deliver competitive, even superior results to state-of-the-art supervised methods on popular IR benchmarks. Furthermore, to address concerns about data contamination of LLMs, we collect a new test set called NovelEval, based on the latest knowledge and aiming to verify the model's ability to rank unknown knowledge. Finally, to improve efficiency in real-world applications, we delve into the potential for distilling the ranking capabilities of ChatGPT into small specialized models using a permutation distillation scheme. Our evaluation results turn out that a distilled 440M model outperforms a 3B supervised model on the BEIR benchmark. The code to reproduce our results is available at www.github.com/sunnweiwei/RankGPT.

arXiv comments
EMNLP 2023
Journal reference
DOI
Subjects
cs.CLComputation and Language cs.IRInformation Retrieval

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jun 2024 to Jun 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

  • Show HN: rerank-ts – TypeScript Library for Re-Ranking Search Results with LLMs

    Hi HN, we are announcing a TypeScript library for re-ranking search results from vector databases or from full text search indexes. Re-Ranking is a very important step in retrieval for building RAG applications. It almost immediately improves accuracy of LLM's response synthesis as you are able to feed in much more accurate and relevant context. Why? Because while semantic or full text search systems are designed to be fast and fetch semantically or lexically close document chunks, they don't…

Connected through shared HN threads, not inferred similarity or a recommendation.