Pith. sign in

REVIEW 24 cited by

Query2doc: Query Expansion with Large Language Models

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 2303.07678 v2 pith:PL75D4CX submitted 2023-03-14 cs.IR cs.CL

Query2doc: Query Expansion with Large Language Models

classification cs.IR cs.CL
keywords queryllmspseudo-documentsquery2docdenseexpansionlanguagelarge
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper introduces a simple yet effective query expansion approach, denoted as query2doc, to improve both sparse and dense retrieval systems. The proposed method first generates pseudo-documents by few-shot prompting large language models (LLMs), and then expands the query with generated pseudo-documents. LLMs are trained on web-scale text corpora and are adept at knowledge memorization. The pseudo-documents from LLMs often contain highly relevant information that can aid in query disambiguation and guide the retrievers. Experimental results demonstrate that query2doc boosts the performance of BM25 by 3% to 15% on ad-hoc IR datasets, such as MS-MARCO and TREC DL, without any model fine-tuning. Furthermore, our method also benefits state-of-the-art dense retrievers in terms of both in-domain and out-of-domain results.

discussion (0)

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

Forward citations

Cited by 24 Pith papers

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

  1. MARVEL: Multimodal Adaptive Reasoning-intensiVe Expand-rerank and retrievaL

    cs.IR 2026-04 unverdicted novelty 7.0

    MARVEL reaches 37.9 nDCG@10 on the MM-BRIGHT benchmark by combining LLM query expansion, a reasoning-enhanced dense retriever, and GPT-4o CoT reranking, beating prior multimodal encoders by 10.3 points.

  2. RICE-PO: Turning Retrieval Interactions into Credit Signals for Reasoning Agents

    cs.CL 2026-05 unverdicted novelty 6.0

    RICE-PO is a policy optimization framework that converts retrieval interactions into credit signals for latent reasoning steps in agents by selecting high-uncertainty actions as anchors and propagating credit based on...

  3. RICE-PO: Turning Retrieval Interactions into Credit Signals for Reasoning Agents

    cs.CL 2026-05 conditional novelty 6.0

    RICE-PO trains retrieval agents using retrieval scores of intermediate summaries as local rewards, gated by influence and residual-stability estimates, outperforming group-based RL baselines on BRIGHT and BEIR.

  4. FitText: Evolving Agent Tool Ecologies via Memetic Retrieval

    cs.AI 2026-05 unverdicted novelty 6.0

    FitText embeds memetic evolutionary retrieval inside the agent's reasoning loop to iteratively refine pseudo-tool descriptions, raising retrieval rank from 8.81 to 2.78 on ToolRet and pass rate to 0.73 on StableToolBench.

  5. FitText: Evolving Agent Tool Ecologies via Memetic Retrieval

    cs.AI 2026-05 unverdicted novelty 6.0

    FitText embeds evolutionary retrieval of tool descriptions into the agent loop, yielding 2.7-10.6 point NDCG@5 gains on ToolRet and 26.7-point pass-rate gains on StableToolBench.

  6. FitText: Evolving Agent Tool Ecologies via Memetic Retrieval

    cs.AI 2026-05 conditional novelty 6.0

    Agents that evolve pseudo-tool search descriptions during execution reach an 84.3% StableToolBench pass rate, +26.7 points over static query retrieval, with gains growing with base-model capability.

  7. LLM-guided Hierarchical Search for End-to-end Reasoning Intensive Retrieval

    cs.IR 2025-10 conditional novelty 6.0

    An LLM directly traverses a hierarchical semantic index of a corpus, using calibrated path-relevance scores to retrieve documents for reasoning-intensive queries.

  8. A Tale of LLMs and Induced Small Proxies: Scalable Small Language Models for Knowledge Mining

    cs.AI 2025-10 conditional novelty 6.0

    LLM-written pipelines and LLM-generated labels are distilled into one small instruction-following model that performs classification and span extraction cheaply at corpus scale.

  9. Search-o1: Agentic Search-Enhanced Large Reasoning Models

    cs.AI 2025-01 unverdicted novelty 6.0

    Search-o1 integrates agentic retrieval-augmented generation and a Reason-in-Documents module into large reasoning models to dynamically supply missing knowledge and improve performance on complex science, math, coding...

  10. SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration

    cs.AI 2026-07 conditional novelty 5.0

    A multi-agent web-search framework that stores progress in shared evidence, coverage, and failure state reports the best F1 scores among compared baselines on WideSearch (80.3 item F1) and GISA (76.5 set F1).

  11. Designing Reward Signals for Portable Query Generation: A Case Study in Industrial Semantic Job Search

    cs.LG 2026-06 unverdicted novelty 5.0

    Empirical study of RLAIF for portable query generation finds reward shaping controls performance more than optimizer choice and a rule-based reward floor yields +0.147 quality gain.

  12. AgenticRAG: Agentic Retrieval for Enterprise Knowledge Bases

    cs.AI 2026-05 unverdicted novelty 5.0

    AgenticRAG equips an LLM with iterative retrieval and navigation tools, delivering 49.6% recall@1 on BRIGHT, 0.96 factuality on WixQA, and 92% correctness on FinanceBench.

  13. A Reproducibility Study of LLM-Based Query Reformulation

    cs.IR 2026-04 unverdicted novelty 5.0

    A unified evaluation finds LLM query reformulation gains are strongly conditioned on retrieval paradigm, do not consistently transfer to neural retrievers, and are not uniformly improved by larger LLMs.

  14. Can QPP Choose the Right Query Variant? Evaluating Query Variant Selection for RAG Pipelines

    cs.IR 2026-04 unverdicted novelty 5.0

    QPP methods can select query variants that boost end-to-end RAG quality over the original query, though retrieval-optimized variants often fail to produce the best generated answers, revealing a utility gap.

  15. BRIDGE: Multimodal-to-Text Retrieval via Reinforcement-Learned Query Alignment

    cs.IR 2026-04 unverdicted novelty 5.0

    BRIDGE reaches 29.7 nDCG@10 on MM-BRIGHT by RL-aligning multimodal queries to text and using a reasoning retriever, beating multimodal encoders and, when combined with Nomic-Vision, exceeding the best text-only retrie...

  16. Query Expansion in the Age of Pre-trained and Large Language Models: A Comprehensive Survey

    cs.IR 2025-09 unverdicted novelty 5.0

    A comprehensive survey that organizes query expansion methods in the PLM/LLM era along four design dimensions, synthesizes application patterns, and outlines future directions.

  17. Domain-Aware RAG: MoL-Enhanced RL for Efficient Training and Scalable Retrieval

    cs.CL 2025-09 conditional novelty 5.0

    A two-stage RAG training pipeline, MoL continual pre-training plus GRPO reinforcement learning with single-passage training and multi-passage inference, reports state-of-the-art retrieval recall on NFCORPUS and SCIFAC...

  18. R$^2$-Searcher: Calibrating Retrieval and Reasoning Boundaries for Agentic Search

    cs.IR 2026-06 unverdicted novelty 4.0

    R²-Searcher introduces fine-grained evidence modeling, retrieval reflection, and R²PO RL to calibrate retrieval-reasoning boundaries and improve multi-hop QA performance.

  19. Policy-Grounded Dynamic Facet Suggestions for Job Search

    cs.IR 2026-05 unverdicted novelty 4.0

    A policy-grounded retrieval-augmented framework with SLM scoring generates real-time personalized facet suggestions that boost engagement and job search outcomes.

  20. PoliLegalLM: A Technical Report on a Large Language Model for Political and Legal Affairs

    cs.CL 2026-04 unverdicted novelty 4.0

    PoliLegalLM, trained with continued pretraining, progressive SFT, and preference RL on a legal corpus, outperforms similar-scale models on LawBench, LexEval, and a real-world PoliLegal dataset while staying competitiv...

  21. Leveraging Spreading Activation for Improved Document Retrieval in Knowledge-Graph-Based RAG Systems

    cs.AI 2025-12 conditional novelty 4.0

    A spreading-activation retrieval module over an automatically constructed knowledge graph improves multi-hop QA in RAG systems, with up to 39 percentage points gain when combined with chain-of-thought retrieval.

  22. When & How to Write for Personalized Demand-aware Query Rewriting in Video Search

    cs.IR 2025-12 unverdicted novelty 4.0

    WeWrite mines user logs to decide when personalization is needed and trains LLMs with SFT and GRPO to rewrite video search queries, delivering 1.07% more long-view clicks and 2.97% fewer reformulations in live A/B tests.

  23. LLM Ensemble for RAG: Role of Context Length in Zero-Shot Question Answering for BioASQ Challenge

    cs.CL 2025-09 conditional novelty 4.0

    An ensemble of zero-shot LLMs with BM25 retrieval and semantic reranking ranked first in one BioASQ 13 yes/no batch, with longer contexts observed to hurt answer quality.

  24. Query pipeline optimization for cancer patient question answering systems

    cs.CL 2024-12 unverdicted novelty 4.0

    Three-aspect RAG query pipeline optimization for cancer patient QA introduces HSRDR and SEOS and reports 5.24% accuracy gain on Claude-3-haiku versus chain-of-thought on a custom dataset.