Pith. sign in

REVIEW 22 cited by

Query Expansion by Prompting 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 2305.03653 v1 pith:FXWZNHR3 submitted 2023-05-05 cs.IR

Query Expansion by Prompting Large Language Models

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

Query expansion is a widely used technique to improve the recall of search systems. In this paper, we propose an approach to query expansion that leverages the generative abilities of Large Language Models (LLMs). Unlike traditional query expansion approaches such as Pseudo-Relevance Feedback (PRF) that relies on retrieving a good set of pseudo-relevant documents to expand queries, we rely on the generative and creative abilities of an LLM and leverage the knowledge inherent in the model. We study a variety of different prompts, including zero-shot, few-shot and Chain-of-Thought (CoT). We find that CoT prompts are especially useful for query expansion as these prompts instruct the model to break queries down step-by-step and can provide a large number of terms related to the original query. Experimental results on MS-MARCO and BEIR demonstrate that query expansions generated by LLMs can be more powerful than traditional query expansion methods.

discussion (0)

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

Forward citations

Cited by 22 Pith papers

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

  1. An Answer is just the Start: Related Insight Generation for Open-Ended Document-Grounded QA

    cs.CL 2026-04 unverdicted novelty 8.0

    InsightGen uses thematic clustering and graph neighborhood selection to generate diverse, relevant insights for open-ended document-grounded questions and releases the SCOpE-QA dataset of 3000 questions.

  2. When More Reformulations Hurt: Avoiding Drift using Ranker Feedback

    cs.IR 2026-05 unverdicted novelty 7.0

    ReformIR adaptively prioritizes reformulations and documents with a surrogate model guided by ranker feedback to boost recall while suppressing drift under fixed reranking budgets.

  3. SMART: LLM-Augmented Hybrid Retrieval for Dynamic Product Ads

    cs.IR 2026-07 conditional novelty 6.0

    A gated hybrid retrieval system shows rule-based keywords beat LLM queries for retargeting but lose for prospecting, and routing 10% of users to LLM semantic search raises ad conversions by 27.6%.

  4. PCTD: Preference-Guided Counterfactual Task Decomposition for Agent Tool Retrieval

    cs.IR 2026-07 conditional novelty 6.0

    A counterfactual difference reward plus a preference reward reduces reward hacking in LLM task decomposition and improves tool retrieval, especially for unseen tools.

  5. Retrieval-Oriented Code Representations in Agentic Bug Localization

    cs.SE 2026-07 conditional novelty 6.0

    Role-aware file summaries give the best cost-effectiveness for file-level bug localization, beating file paths by up to 40% Hit@5 at far smaller footprint than raw source.

  6. Towards Knowledgeable Deep Research: Framework and Benchmark

    cs.AI 2026-04 unverdicted novelty 6.0

    The paper introduces the KDR task, HKA multi-agent framework, and KDR-Bench to enable LLM agents to integrate structured knowledge into deep research reports, with experiments showing outperformance over prior agents.

  7. Benchmarking Information Retrieval Models on Complex Retrieval Tasks

    cs.IR 2025-09 conditional novelty 6.0

    CRUMB is a new benchmark for complex, multi-aspect retrieval tasks on which state-of-the-art retrieval models score poorly, and query rewriting does not rescue the best models.

  8. Upcycling Candidate Tokens of Large Language Models for Query Expansion

    cs.IR 2025-09 conditional novelty 6.0

    Using unselected top-k candidate tokens from a single LLM decoding pass as extra query terms improves retrieval over standard keyword expansion while using far fewer tokens than document-level methods.

  9. RankFlow: A Multi-Role Collaborative Reranking Workflow Utilizing Large Language Models

    cs.IR 2025-02 unverdicted novelty 6.0

    RankFlow deploys four LLM roles in sequence to rewrite queries, generate pseudo-answers, summarize passages, and rerank candidates, outperforming prior methods on TREC-DL, BEIR, and NovelEval.

  10. 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.

  11. 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.

  12. Chinese Short-Form Creative Content Generation via Explanation-Oriented Multi-Objective Optimization

    cs.CL 2025-11 unverdicted novelty 5.0

    MAGIC-HMO is a multi-agent framework that treats Chinese short-form creative NLG as heterogeneous multi-objective optimization over personalized constraints plus explanation reliability and outperforms baselines on a ...

  13. 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.

  14. 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...

  15. Retrieval-Augmented Generation with Graphs (GraphRAG)

    cs.IR 2024-12 unverdicted novelty 5.0

    A survey proposing a holistic GraphRAG framework with components including query processor, retriever, organizer, generator, and data source, plus domain-tailored reviews, challenges, and future directions.

  16. A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions

    cs.CL 2023-11 unverdicted novelty 5.0

    The paper surveys hallucination in LLMs with an innovative taxonomy, factors, detection methods, benchmarks, mitigation strategies, and open research directions.

  17. Hierarchical Reranking for Scalable Financial RAG System

    cs.IR 2026-07 reject novelty 4.0

    A finance-specific RAG pipeline combining table-to-JSON conversion, two-stage reranking, and long-context split-fusion reports NDCG@20=0.7918 and second place in the ICAIF '24 FinanceRAG challenge.

  18. 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.

  19. 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.

  20. 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.

  21. A Case Study of Balanced Query Recommendation on Wikipedia

    cs.IR 2025-08 conditional novelty 4.0

    BalancedQR, extended to handle multiple bias dimensions with a Pareto front, recommends less biased Wikipedia queries, and a GloVe-plus-LLM candidate generation method dominates alternatives.

  22. WisPaper: Your AI Scholar Search Engine

    cs.IR 2025-12 unverdicted novelty 3.0

    WisPaper integrates semantic search with agent-based validation, library organization, and personalized AI feeds into a closed-loop system that improves academic paper discovery and long-term awareness.