REVIEW 15 cited by
Document Ranking with a Pretrained Sequence-to-Sequence Model
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
Signed reviews
read the original abstract
This work proposes a novel adaptation of a pretrained sequence-to-sequence model to the task of document ranking. Our approach is fundamentally different from a commonly-adopted classification-based formulation of ranking, based on encoder-only pretrained transformer architectures such as BERT. We show how a sequence-to-sequence model can be trained to generate relevance labels as "target words", and how the underlying logits of these target words can be interpreted as relevance probabilities for ranking. On the popular MS MARCO passage ranking task, experimental results show that our approach is at least on par with previous classification-based models and can surpass them with larger, more-recent models. On the test collection from the TREC 2004 Robust Track, we demonstrate a zero-shot transfer-based approach that outperforms previous state-of-the-art models requiring in-dataset cross-validation. Furthermore, we find that our approach significantly outperforms an encoder-only model in a data-poor regime (i.e., with few training examples). We investigate this observation further by varying target words to probe the model's use of latent knowledge.
Forward citations
Cited by 15 Pith papers
-
How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models
On a new benchmark of post-April 2025 queries, LLM rerankers show a 5-15% performance drop compared with familiar benchmarks, and lightweight models match them on efficiency and sometimes accuracy.
-
DocReRank: Single-Page Hard Negative Query Generation for Training Multi-Modal RAG Rerankers
Training a reranker on VLM-verified hard negative queries, generated per page from LLM rephrasings of positive queries, outperforms training on document-level hard negatives in multimodal RAG retrieval.
-
Evaluating the Robustness of Retrieval-Augmented Generation to Adversarial Evidence in the Health Domain
Misleading health documents in RAG context sharply lower LLM accuracy, and heavily helpful-biased retrieval pools restore it.
-
Universal Biological Sequence Reranking for Improved De Novo Peptide Sequencing
RankNovo, a list-wise reranker with mass-deviation supervision, improves de novo peptide sequencing accuracy by selecting among candidates from multiple base models.
-
White Hat Search Engine Optimization using Large Language Models
LLM prompts that include past rankings produce document edits that improve retrieval ranking more than human students and a feature-based baseline, while keeping the text faithful.
-
RoToR: Towards More Reliable Responses for Order-Invariant Inputs
RoToR makes a frozen LLM order-invariant by circularly rotating a single global sort of segment position IDs, and Selective Routing combines it with the original model for mixed lists.
-
Matryoshka Re-Ranker: A Flexible Re-Ranking Architecture With Configurable Depth and Width
A single LLM re-ranker can be configured at runtime to different depths and widths, with training tricks that keep compressed variants close to full-scale accuracy.
-
Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks
Reranking symmetric-task inputs so that query-relevant elements occupy high-exposure positions can substantially reduce LLM errors on aggregate queries.
-
Seeing the Forest Through the Trees: Knowledge Retrieval for Streamlining Particle Physics Analysis
Retrieving answers from the LHCb literature using hierarchical paper trees and a knowledge graph of uncertainties modestly outperforms standard chunk-based RAG in a proof-of-concept.
-
FlexRAG: A Flexible and Comprehensive Framework for Retrieval-Augmented Generation
FlexRAG is a modular, open-source RAG framework with text, multimodal, and web retrieval, plus evaluation tools and efficient memory-mapped indexing.
-
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching
Under an LLM-inference cost model, Quicksort with batching uses roughly 44% fewer inference calls than Heapsort for pairwise document ranking, reversing the classical comparison-count ordering.
-
LLM Alignment as Retriever Optimization: An Information Retrieval Perspective
LARPO, an iterative preference optimization method that adapts information retrieval techniques such as listwise ranking losses, hard negatives, and candidate lists, is claimed to substantially improve LLM alignment o...
-
Rankify: A Comprehensive Python Toolkit for Retrieval, Re-Ranking, and Retrieval-Augmented Generation
The paper presents Rankify, a modular open-source toolkit that unifies retrieval, re-ranking, and RAG with 40 pre-retrieved datasets and benchmark results.
-
Automating AI Failure Tracking: Semantic Association of Reports in AI Incident Database
Sentence-embedding retrieval ranks the correct AI Incident in the top three for about 98% of test reports when titles and descriptions are combined, but possible train/test leakage likely inflates that number.
-
Exp4Fuse: A Rank Fusion Framework for Enhanced Sparse Retrieval using Large Language Model-based Query Expansion
Exp4Fuse improves sparse retrieval by fusing the ranked lists from the original query and an LLM-expanded query using a modified reciprocal rank fusion.
Discussion (0). Continue with ORCID to comment.