Pith. sign in

REVIEW 9 cited by

The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Models

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2101.05667 v1 pith:SKSVQLJZ submitted 2021-01-14 cs.IR cs.CL

Ronak Pradeep , Rodrigo Nogueira , Jimmy Lin This is my paper
classification cs.IRcs.CL
keywords designrankingpatterntasksdocumentexpando-mono-duokeywordmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a design pattern for tackling text ranking problems, dubbed "Expando-Mono-Duo", that has been empirically validated for a number of ad hoc retrieval tasks in different domains. At the core, our design relies on pretrained sequence-to-sequence models within a standard multi-stage ranking architecture. "Expando" refers to the use of document expansion techniques to enrich keyword representations of texts prior to inverted indexing. "Mono" and "Duo" refer to components in a reranking pipeline based on a pointwise model and a pairwise model that rerank initial candidates retrieved using keyword search. We present experimental results from the MS MARCO passage and document ranking tasks, the TREC 2020 Deep Learning Track, and the TREC-COVID challenge that validate our design. In all these tasks, we achieve effectiveness that is at or near the state of the art, in some cases using a zero-shot approach that does not exploit any training data from the target task. To support replicability, implementations of our design pattern are open-sourced in the Pyserini IR toolkit and PyGaggle neural reranking library.

Discussion (0). Sign in to comment.

Forward citations

Cited by 9 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DocReRank: Single-Page Hard Negative Query Generation for Training Multi-Modal RAG Rerankers

    cs.IR 2025-05 conditional novelty 7.0 of 10

    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.

  2. Trie-based Experiment Plans for Efficient IR Pipeline Experiments

    cs.IR 2026-07 unverdicted novelty 6.0 of 10

    Trie-based experiment plans reduce the duration of comparative evaluations of IR pipelines by 26% versus linear plans in a BM25-MonoT5-DuoT5 demonstration on MSMARCO v2.

  3. Are LLMs Reliable Rankers? Rank Manipulation via Two-Stage Token Optimization

    cs.CL 2025-10 conditional novelty 6.0 of 10

    RAF, a two-stage token-optimization attack, creates brief natural-sounding text injections that reliably boost a target item's rank in LLM reranking outputs, beating state-of-the-art baselines in effectiveness, stealt...

  4. Constructing and Evaluating Declarative RAG Pipelines in PyTerrier

    cs.IR 2025-06 conditional novelty 6.0 of 10

    PyTerrier-RAG extends PyTerrier with datatypes, readers, datasets, and metrics for building and evaluating declarative retrieval-augmented generation pipelines.

  5. Towards a Relevance Posterior in Neural Information Access

    cs.IR 2026-07 conditional novelty 5.0 of 10

    Fusing a cached query-independent document-quality prior with BM25 or re-rankers improves TREC DL nDCG, with largest gains for RankZephyr, under a prior–likelihood view of retrieval.

  6. RankLLM: A Python Package for Reranking with LLMs

    cs.IR 2025-05 accept novelty 5.0 of 10

    RankLLM is an open-source Python package that modularly supports pointwise, pairwise, and listwise LLM rerankers, with integrated retrieval, evaluation, training, and response analysis, and reproduces results from Ran...

  7. MagicSelector: Joint Optimization for Agent Tool Selection via Counterfactual Decomposition and Progressive Reranking

    cs.IR 2026-07 conditional novelty 4.0 of 10

    MagicSelector combines RL-trained task decomposition, iterative hard-negative reranking, and adaptive top-k truncation to improve mobile-agent tool retrieval, evaluated on a new MTDTool benchmark.

  8. HF-RAG: Hierarchical Fusion-based RAG with Multiple Sources and Rankers

    cs.IR 2025-09 conditional novelty 4.0 of 10

    By first fusing multiple retrievers within labeled and unlabeled sources with RRF, then merging z-score normalized lists, HF-RAG improves fact-verification F1 in-domain and out-of-domain.

  9. UiS-IAI@LiveRAG: Retrieval-Augmented Information Nugget-Based Generation of Responses

    cs.IR 2025-06 conditional novelty 4.0 of 10

    A nugget-based RAG pipeline with query rewriting and cluster-based summarization is applied to the LiveRAG challenge, where few rewrites plus the original query improve recall and larger document cutoffs hit diminishi...

Pith tools