Pith. sign in

REVIEW 1 cited by

MoR: Better Handling Diverse Queries with a Mixture of Sparse, Dense, and Human Retrievers

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

arxiv 2506.15862 v1 pith:IUXK5WG5 submitted 2025-06-18 cs.IR cs.AIcs.CL

MoR: Better Handling Diverse Queries with a Mixture of Sparse, Dense, and Human Retrievers

classification cs.IR cs.AIcs.CL
keywords retrieversmixtureanalysisdensediversehumanindividualinformation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Retrieval-augmented Generation (RAG) is powerful, but its effectiveness hinges on which retrievers we use and how. Different retrievers offer distinct, often complementary signals: BM25 captures lexical matches; dense retrievers, semantic similarity. Yet in practice, we typically fix a single retriever based on heuristics, which fails to generalize across diverse information needs. Can we dynamically select and integrate multiple retrievers for each individual query, without the need for manual selection? In our work, we validate this intuition with quantitative analysis and introduce mixture of retrievers: a zero-shot, weighted combination of heterogeneous retrievers. Extensive experiments show that such mixtures are effective and efficient: Despite totaling just 0.8B parameters, this mixture outperforms every individual retriever and even larger 7B models by +10.8% and +3.9% on average, respectively. Further analysis also shows that this mixture framework can help incorporate specialized non-oracle human information sources as retrievers to achieve good collaboration, with a 58.9% relative performance improvement over simulated humans alone.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Adaptive Re-Ranking

    cs.IR 2026-06 unverdicted novelty 5.0

    Adaptive Re-Ranking trains a classifier to route queries to BM25, MiniLM-L6-v2, or BGE-v2-m3 based on a utility label, yielding 1.15-53x lower median latency and competitive nDCG@10 versus always using the heaviest model.