Pith. sign in

hub Canonical reference

[Online; accessed 2025-07-26]

Canonical reference. 78% of citing Pith papers cite this work as background.

28 Pith papers citing it
23 external citations · Pith
Background 78% of classified citations
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.

hub tools

citation-role summary

background 7 baseline 1 dataset 1

citation-polarity summary

representative citing papers

Access Paths for Efficient Ordering with Large Language Models

cs.DB · 2025-08-30 · unverdicted · novelty 6.0

Introduces the LLM ORDER BY semantic operator with algorithmic improvements, a semantic-aware external merge sort, and a budget-aware optimizer that selects near-optimal access paths for LLM-based ordering.

EviRank: Evidence-Based Confidence Estimation for LLM-Based Ranking

cs.IR · 2026-06-03 · unverdicted · novelty 5.0

EviRank extracts three evidences from a single LLM forward pass, aggregates them with reliable opinion pooling and position-aware calibration, then uses the result to optimize rankings, claiming SOTA on recommendation and uncertainty quantification across three datasets.

LRanker: LLM Ranker for Massive Candidates

cs.IR · 2026-05-27 · unverdicted · novelty 5.0

LRanker combines K-means candidate aggregation with graph-partitioned ensemble of query embeddings to improve LLM ranking accuracy and scalability on massive candidate pools, reporting 3-30% gains on RBench tasks up to 6.8M candidates.

BeLink: Biomedical Entity Linking Meets Generative Re-Ranking

cs.CL · 2026-05-21 · unverdicted · novelty 5.0

BeLink applies set-wise instruction-tuning to generative LLMs at the re-ranking stage of biomedical entity linking, reporting 3-24% accuracy gains and reduced inference time versus prior methods.

InfluMatch: Frontier-Quality KOL Search at 4B-Model Cost

cs.CL · 2026-07-07 · conditional · novelty 4.0

A 4B-model cascade for Thai KOL matching reaches 94.1% P@5 on 11 queries, matching a frontier model, with pairwise SimPO training transferring end-to-end while pointwise SFT+GRPO does not.

ClinQueryAgent: A Conversational Agent for Population Health Management

cs.IR · 2026-04-13 · unverdicted · novelty 4.0

The paper introduces ClinQueryAgent, a conversational agent that converts natural language queries into database queries for population health management while keeping patient data secure, and reports its use by 128 staff across 15 NHS practices covering 148,319 patients.

citing papers explorer

Showing 28 of 28 citing papers.