mlsanityData to 14 Oct 2026

Exp4Fuse: A Rank Fusion Framework for Enhanced Sparse Retrieval using Large Language Model-based Query Expansion

arXiv 2506.04760 ↗First posted 5 Jun 2025cs.IR cs.AI cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) have shown potential in generating hypothetical documents for query expansion, thereby enhancing information retrieval performance. However, the efficacy of this method is highly dependent on the quality of the generated documents, which often requires complex prompt strategies and the integration of advanced dense retrieval techniques. This can be both costly and computationally intensive. To mitigate these limitations, we explore the use of zero-shot LLM-based query expansion to improve sparse retrieval, particularly for learned sparse retrievers. We introduce a novel fusion ranking framework, Exp4Fuse, which enhances the performance of sparse retrievers through an indirect application of zero-shot LLM-based query expansion. Exp4Fuse operates by simultaneously considering two retrieval routes-one based on the original query and the other on the LLM-augmented query. It then generates two ranked lists using a sparse retriever and fuses them using a modified reciprocal rank fusion method. We conduct extensive evaluations of Exp4Fuse against leading LLM-based query expansion methods and advanced retrieval techniques on three MS MARCO-related datasets and seven low-resource datasets. Experimental results reveal that Exp4Fuse not only surpasses existing LLM-based query expansion methods in enhancing sparse retrievers but also, when combined with advanced sparse retrievers, achieves SOTA results on several benchmarks. This highlights the superior performance and effectiveness of Exp4Fuse in improving query expansion for sparse retrieval.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 24 of its 37 references that are in the map. First posted on arXiv 5 Jun 2025.

Builds on

24 of 37 references.

References · 24

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
  3. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  4. 2022Precise Zero-Shot Dense Retrieval without Relevance Labelscited by 517
  5. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
  6. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 376
  7. 2020Overview of the TREC 2019 deep learning trackcited by 286
  8. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 286
  9. 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 272
  10. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  11. 2019Document Expansion by Query Predictioncited by 231
  12. 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
12 more
  1. 2019Multi-Stage Document Ranking with BERTcited by 201
  2. 2021Overview of the TREC 2020 deep learning trackcited by 196
  3. 2023Recommender Systems in the Era of Large Language Models (LLMs)cited by 189
  4. 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 145
  5. 2022From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effectivecited by 98
  6. 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
  7. 2020RepBERT: Contextualized Text Embeddings for First-Stage Retrievalcited by 46
  8. 2022Enhancing Multi-modal and Multi-hop Question Answering via Structured Knowledge and Unified Retrieval-Generationcited by 28
  9. 2022Out-of-Domain Semantics to the Rescue! Zero-Shot Hybrid Retrieval Modelscited by 26
  10. 2021RetGen: A Joint framework for Retrieval and Grounded Text Generation Modelingcited by 22
  11. 2023SLIM: Sparsified Late Interaction for Multi-Vector Retrieval with Inverted Indexescited by 12
  12. 2022Compact Token Representations with Contextual Quantization for Efficient Document Re-rankingcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 4.

6 papers.