Low-Cost Document Retrieval with Dense Pseudo-Query Encoding
Low-cost retrieval is crucial for document search on resource-limited computing platforms. This paper presents a staged sparse-to-dense retrieval framework that substitutes expensive dense query encoding with a dense pseudo-query (DPQ), an approximation derived solely from sparse retrieval results. DPQ scheme employs a simple, rank-aware weighting to combine corresponding dense representations of top sparse results, providing an opportunity to efficiently leverage an expensive but expressive LLM or BERT-based dense model without requiring GPUs. The evaluation demonstrates that DPQ-based retrieval runs fast on an affordable platform and outperforms several low-cost baselines in zero-shot retrieval.
Authors
- Parker Carlson (ORCID: https://orcid.org/0000-0003-1856-5088)
- Shanxiu He (ORCID: https://orcid.org/0009-0008-8581-6733)
- Tao Yang (ORCID: https://orcid.org/0000-0003-1902-3387)
- Yifan Qiao (ORCID: https://orcid.org/0000-0001-5717-2637)
- Wentai Xie
Institutions
- University of California, Santa Barbara (US)
- Apple (United States) (US)
Publication Details
- Published
- 2025-07-13
- DOI
- https://doi.org/10.1145/3726302.3730227
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation