REVIEW 4 cited by
LLM4Ranking: An Easy-to-use Framework of Utilizing Large Language Models for Document Reranking
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Utilizing large language models (LLMs) for document reranking has been a popular and promising research direction in recent years, many studies are dedicated to improving the performance and efficiency of using LLMs for reranking. Besides, it can also be applied in many real-world applications, such as search engines or retrieval-augmented generation. In response to the growing demand for research and application in practice, we introduce a unified framework, \textbf{LLM4Ranking}, which enables users to adopt different ranking methods using open-source or closed-source API-based LLMs. Our framework provides a simple and extensible interface for document reranking with LLMs, as well as easy-to-use evaluation and fine-tuning scripts for this task. We conducted experiments based on this framework and evaluated various models and methods on several widely used datasets, providing reproducibility results on utilizing LLMs for document reranking. Our code is publicly available at https://github.com/liuqi6777/llm4ranking.
Forward citations
Cited by 4 Pith papers
-
mRAG: Elucidating the Design Space of Multi-modal Retrieval-Augmented Generation
A systematic empirical study finds that for multimodal RAG, EVA-CLIP retrieval, listwise LVLM reranking, and feeding only the top-ranked document works best, with a self-reflection agent adding further gains.
-
SearchArt: Training Long-Horizon Search Agent with Scalable Synthetic and Verified Task
SearchArt post-trains Qwen3.5-27B on verification-filtered synthetic search trajectories, scoring 74.39 on BrowseComp-ZH, 70.06 on BrowseComp, and 52.55 on DeepResearch-Bench, competitive with several 200B-700B agents.
-
Scaling Search Relevance: Augmenting App Store Ranking with LLM-Generated Judgments
Using a fine-tuned 3B LLM to generate millions of textual relevance labels for App Store search improves the ranker's behavioral/textual Pareto frontier and lifts conversion by 0.24%.
-
How Reliable are LLMs for Reasoning on the Re-ranking task?
In a small Earth-science reranking dataset, DPO-trained LLMs rank best and SHAP attribution scores help a general LLM explain why items were selected, but the explanation claim rests on only two examples.
Discussion (0). Continue with ORCID to comment.