REVIEW 6 cited by
Pyserini: An Easy-to-Use Python Toolkit to Support Replicable IR Research with Sparse and Dense Representations
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
Pyserini is an easy-to-use Python toolkit that supports replicable IR research by providing effective first-stage retrieval in a multi-stage ranking architecture. Our toolkit is self-contained as a standard Python package and comes with queries, relevance judgments, pre-built indexes, and evaluation scripts for many commonly used IR test collections. We aim to support, out of the box, the entire research lifecycle of efforts aimed at improving ranking with modern neural approaches. In particular, Pyserini supports sparse retrieval (e.g., BM25 scoring using bag-of-words representations), dense retrieval (e.g., nearest-neighbor search on transformer-encoded representations), as well as hybrid retrieval that integrates both approaches. This paper provides an overview of toolkit features and presents empirical results that illustrate its effectiveness on two popular ranking tasks. We also describe how our group has built a culture of replicability through shared norms and tools that enable rigorous automated testing.
Forward citations
Cited by 6 Pith papers
-
Tevatron-Elastic: A Unified Abstraction for Training Elastic Retrievers and Rerankers
Tevatron-Elastic unifies depth, token, and width compression for retrievers and rerankers into one abstraction that reproduces prior elastic methods as special cases and adds a new multi-ratio token compression method (MLTC).
-
BM25 Wins at Scale: A Scaling Study of Retrieval-Augmented Generation Paradigms
On an enterprise corpus scaled from 1.7M to 601M tokens, BM25 beats raw-file agentic search, dense retrieval, and graph RAG at large sizes, crossing near 10M tokens.
-
Replication and Exploration of Generative Retrieval over Dynamic Corpora
Generative retrieval with text-based docids (n-grams, titles, URLs) generalizes to newly added documents far better than numeric docids, and a constrained multi-docid numeric design recovers much of the gap on NQ.
-
Rethinking On-policy Optimization for Query Augmentation
Simple zero-shot prompt-based query expansion matches costly RL-trained query rewriting in retrieval benchmarks, and training the RL policy to generate pseudo-documents (OPQE) yields the best overall scores.
-
Investigating the Robustness of Retrieval-Augmented Generation at the Query Level
Retrieval-augmented generation performance drops noticeably under minor query perturbations, with end-to-end results often tracking retriever behavior.
-
Improve Rule Retrieval and Reasoning with Self-Induction and Relevance ReEstimate
Using an LLM to induce an abstract rule from a query and then re-ranking retrieved rules with an LLM prompt improves rule retrieval and downstream reasoning in most tested configurations.
Discussion (0). Continue with ORCID to comment.