paper-with-me

홈 › Papers

Efficiency-Effectiveness Reranking FLOPs for LLM-based Rerankers

2025-07-08 · Zhiyuan Peng, Ting-Ruen Wei, Tingyu Song, Yilun Zhao, Yi Fang

Large Language Models (LLMs) have recently been applied to reranking tasks in information retrieval, achieving strong performance. However, their high computational demands often hinder practical deployment. Existing studies evaluate the efficiency of LLM-based rerankers using proxy metrics such as latency, the number of forward passes, input tokens, and output tokens. However, these metrics depend on hardware and running-time choices (\eg parallel or not, batch size, etc), and often fail to account for model size, making it difficult to interpret and obscuring the evaluation of the efficiency-effectiveness tradeoff. To address this issue, we propose E\textsuperscript{2}R-FLOPs, for LLM-based rerankers: ranking metrics per PetaFLOP (RPP) for relevance per compute and queries per PetaFLOP (QPP) for hardware-agnostic throughput. Companied with the new metrics, an interpretable FLOPs estimator is built to estimate the FLOPs of an LLM-based reranker even without running any experiments. Based on the proposed metrics, we conduct comprehensive experiments to evaluate a wide range of LLM-based rerankers with different architecture, studying the efficiency-effectiveness trade-off and bringing this issue to the attention of the research community.

📄 PDF Abstract BibTeX arXiv:2507.06223

Code (1)

zhiyuanpeng/eer-flops 공식 구현 pytorch

Tasks

Information RetrievalReranking

Similar Papers 제목 키워드 기반

How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models

2025-08-22 · Abdelrahman Abdallah, Bhawna Piryani, Jamshid Mozafari, Mohammed Ali 외 arxiv

In this work, we present a systematic and comprehensive empirical evaluation of state-of-the-art reranking methods, encompassing large language model (LLM)-based, lightweight contextual, and zero-shot approaches, with re…

Computational EfficiencyInformation Retrieval

Rank-K: Test-Time Reasoning for Listwise Reranking

2025-05-20 · Eugene Yang, Andrew Yates, Kathryn Ricci, Orion Weller 외

Retrieve-and-rerank is a popular retrieval pipeline because of its ability to make slow but effective rerankers efficient enough at query time by reducing the number of comparisons. Recent works in neural rerankers take …

Language ModelingLanguage ModellingPassage RerankingReranking+1

FIRST: Faster Improved Listwise Reranking with Single Token Decoding

2024-06-21 · Revanth Gangi Reddy, JaeHyeok Doo, Yifei Xu, Md Arafat Sultan 외

Large Language Models (LLMs) have significantly advanced the field of information retrieval, particularly for reranking. Listwise LLM rerankers have showcased superior performance and generalizability compared to existin…

Information RetrievalLanguage ModelingLanguage ModellingLearning-To-Rank+1

Decision-Oriented Recommendation Reranking: An Empirical Study of Jev

2026-09-30 · Hanjia Lyu, Yinglong Xia hf

Large language models (LLMs) have shown promise for recommendation reranking, but their use introduces an important tradeoff between recommendation quality and serving efficiency. We investigate whether a decision-orient…

An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking

2024-11-08 · Zijian Chen, Ronak Pradeep, Jimmy Lin

Recent advances have demonstrated that large language models (LLMs) excel as listwise rerankers, but their high computational demands remain a barrier to widespread adoption. Further, the traditional language modeling (L…

Language ModelingLanguage ModellingLearning-To-RankReranking