Browse State-of-the-Art › Passage Re-Ranking
Passage Re-Ranking
19 papers with code · 2 benchmarks · 2 datasets archive 2025-07-28
Passage re-ranking is the task of scoring and re-ranking a collection of retrieved documents based on an input query.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
2 leaderboard tables shown for this task, 2 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| MS MARCO (4 rows) | HLATR | HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware... | code | — | Compare |
| TREC-PM (1 row) | BERT + Doc2query | Document Expansion by Query Prediction | code | Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
2 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 32 · with a code link: 19 · where Syntology ran a sample: 3 (2 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (3 of 32 tagged: 2 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 32 of 32, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
13 Jan 2019 6 repositories listed Syntology official (archive's flag): 11 ran · 11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified (of 13 harvested samples) · 2 pointer-only (licence)Recently, neural models pretrained on a language modeling task, such as ELMo (Peters et al., 2017), OpenAI GPT (Radford et al., 2018), and BERT (Devlin et al., 2018), have achieved impressive results on various natural…
-
17 Apr 2019 5 repositories listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)One technique to improve the retrieval effectiveness of a search engine is to expand documents with terms that are related or representative of the documents' content.
-
13 May 2024 2 repositories listedCross-encoders distilled from large language models (LLMs) are often more effective re-rankers than cross-encoders fine-tuned on manually labeled data.
-
10 Apr 2024 2 repositories listedExisting cross-encoder models can be categorized as pointwise, pairwise, or listwise.
-
25 May 2022 2 repositories listedTo alleviate the need for a large number of labeled question-document pairs for retriever training, we propose PromptRank, which relies on large language models prompting for multi-hop path reranking.
-
27 Aug 2021 2 repositories listedOur experimental results on the MS MARCO passage ranking dataset show that, with our proposed typos-aware training, DR and BERT re-ranker can become robust to typos in queries, resulting in significantly improved…
-
28 Mar 2025 1 repository listedState-of-the-art cross-encoders can be fine-tuned to be highly effective in passage re-ranking.
-
3 Apr 2024 1 repository listedIn Open-domain Question Answering (ODQA), it is essential to discern relevant contexts as evidence and avoid spurious ones among retrieved results.
-
24 May 2023 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result (of 2 harvested samples) · 2 pointer-only (licence)Transformer-based language models (LMs) are powerful and widely-applicable tools, but their usefulness is constrained by a finite context window and the expensive computational cost of processing long text documents.
-
26 Apr 2023 1 repository listedThis paper presents ConvRerank, a conversational passage re-ranker that employs a newly developed pseudo-labeling approach.
-
7 Apr 2023 1 repository listedT2Ranking comprises more than 300K queries and over 2M unique passages from real-world search engines.
-
21 May 2022 1 repository listedExisting text retrieval systems with state-of-the-art performance usually adopt a retrieve-then-reranking architecture due to the high computational cost of pre-trained language models and the large corpus size.
-
14 Oct 2021 1 repository listedIn this paper, we propose a novel joint training approach for dense passage retrieval and passage re-ranking.
-
19 Aug 2021 1 repository listedBERT-based information retrieval models are expensive, in both time (query latency) and computational resources (energy, hardware cost), making many of these models impractical especially under resource constraints.
-
25 Jun 2021 1 repository listedIn contrast to the matching paradigm, the probabilistic nature of generative rankers readily offers a fine-grained measure of uncertainty.
-
14 Jun 2021 1 repository listedRecently, pre-trained contextual models, such as BERT, have shown to perform well in language related tasks.
-
28 Apr 2021 1 repository listedIn this work, we first provide a novel framework to measure the fairness in the retrieved text contents of ranking models.
-
18 Jan 2021 1 repository listedIn this work we analyze position bias on datasets, the contextualized representations, and their effect on retrieval results.
-
18 Mar 2019 1 repository listedWe propose several small modifications to Duet---a deep neural ranking model---and evaluate the updated model on the MS MARCO passage ranking task.
-
Re-Ranking Step by Step: Investigating Pre-Filtering for Re-Ranking with Large Language Models26 Jun 2024 0 repositories listedLarge Language Models (LLMs) have been revolutionizing a myriad of natural language processing tasks with their diverse zero-shot capabilities.
-
Efficient Document Ranking with Learnable Late Interactions25 Jun 2024 0 repositories listedCross-Encoder (CE) and Dual-Encoder (DE) models are two fundamental approaches for query-document relevance in information retrieval.
-
PaRaDe: Passage Ranking using Demonstrations with Large Language Models22 Oct 2023 0 repositories listedRecent studies show that large language models (LLMs) can be instructed to effectively perform zero-shot passage re-ranking, in which the results of a first stage retrieval method, such as BM25, are rated and reordered…
-
Incorporating Explicit Knowledge in Pre-trained Language Models for Passage Re-ranking25 Apr 2022 0 repositories listedPassage re-ranking is to obtain a permutation over the candidate passage set from retrieval stage.
-
Quality and Cost Trade-offs in Passage Re-ranking Task18 Nov 2021 0 repositories listedDeep learning models named transformers achieved state-of-the-art results in a vast majority of NLP tasks at the cost of increased computational complexity and high memory consumption.
-
Towards Robust Passage Re-Ranking Model by Mitigating Lexical Match Bias16 Nov 2021 0 repositories listedWhile deep learning models can overcome the limitations of traditional machine learning algorithms that use hand-crafted features, recent studies have shown that these models often achieve high dataset-specific accuracy…
-
Text-to-Text Multi-view Learning for Passage Re-ranking29 Apr 2021 0 repositories listedRecently, much progress in natural language processing has been driven by deep contextualized representations pretrained on large corpora.
-
Improving Passage Re-Ranking with Word N-Gram Aware Coattention Encoder1 Dec 2020 0 repositories listedIn text matching applications, coattentions have proved to be highly effective attention mechanisms.
-
Multi-Perspective Semantic Information Retrieval in the Biomedical Domain17 Jul 2020 0 repositories listedInformation Retrieval (IR) is the task of obtaining pieces of data (such as documents) that are relevant to a particular query or need from a large repository of information.
-
Learning-to-Rank with BERT in TF-Ranking17 Apr 2020 0 repositories listedThis paper describes a machine learning algorithm for document (re)ranking, in which queries and documents are firstly encoded using BERT [1], and on top of that a learning-to-rank (LTR) model constructed with…
-
A Study of BERT for Non-Factoid Question-Answering under Passage Length Constraints19 Aug 2019 0 repositories listedWe study the use of BERT for non-factoid question-answering, focusing on the passage re-ranking task under varying passage lengths.
-
Investigating the Successes and Failures of BERT for Passage Re-Ranking5 May 2019 0 repositories listed
-
A Study on Passage Re-ranking in Embedding based Unsupervised Semantic Search22 Apr 2018 0 repositories listed
Syntology lines on 3 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections