---
title: 'Exp4Fuse: Dual-Route Rank Fusion'
url: https://www.emergentmind.com/topics/exp4fuse
type: topic
---

# Exp4Fuse: Dual-Route Rank Fusion

Exp4Fuse is a two-stage, dual-route rank fusion framework designed to enhance the effectiveness of sparse information retrieval systems by integrating zero-shot large language model (LLM)–based query expansion in a computationally efficient manner. The method addresses key limitations of previous LLM-based query expansion techniques for sparse retrievers, such as complex prompting and reliance on dense re-ranking, by leveraging a fusion architecture that maximizes both semantic coverage and lexical precision without requiring multiple dense or multi-stage retrieval passes. Exp4Fuse has demonstrated state-of-the-art (SOTA) performance on several benchmarks when augmenting modern learned sparse retrievers, particularly SPLADE++ and uniCOIL variants, and consistently surpasses previous LLM-based query expansion baselines in both effectiveness and cost-efficiency [2506.04760].

## 1. Dual-Route Fusion Architecture

Exp4Fuse operates via a two-stage retrieval and fusion paradigm:

- In Stage 1, two independent retrieval routes are established based on a user query \(q_o\):
  - **Original Query Route (OQ):** The unaltered query \(q_o\) is fed to a sparse retriever, yielding ranked list \(I_{oq}\).
  - **LLM-Augmented Query Route (EQ):** A zero-shot LLM prompt (“Please write a passage to answer the question. \(\langle q_o\rangle\).”) generates a hypothetical document \(r_q\). To balance document and query lengths, the query is repeated \(\lambda=5\) times and concatenated with \(r_q\): \(q_e = \text{concat}(q_o \times \lambda, r_q)\). The expanded query \(q_e\) is submitted to the same sparse retriever, obtaining \(I_{eq}\).

- In Stage 2, the outputs \(I_{oq}\) and \(I_{eq}\) are merged by a modified reciprocal rank fusion (RRF) algorithm that integrates list-specific weights and penalizes list-only appearance, yielding the final fused ranking \(I_{fq}\).

This dual-route structure preserves the high recall of learned sparse retrievers on exact-match queries while adding semantic breadth through LLM-augmented keyword expansion.

## 2. Modified Reciprocal Rank Fusion Methodology

Exp4Fuse introduces a variant of reciprocal rank fusion that incorporates both query-route weighting and presence counts:

- For each document \(d\), let \(r_1(d)\) and \(r_2(d)\) be the ranks in \(I_{oq}\) and \(I_{eq}\) respectively, and \(n(d)\) the number of lists (\(\{1,2\}\)) in which \(d\) appears.
- The fused score is:
  $$
  \text{FR\_score}(d) = \bigl(w_1 + w_2 + \tfrac{n(d)}{10}\bigr)\;\sum_{i=1}^{2}\frac{1}{k + r_i(d)}, \qquad (k=60)
  $$
- Default weights are \(w_1=w_2=1\). This heuristic boosts documents retrieved by both routes, penalizes unique-only appearances, and smooths score contributions, stabilizing fusion across different sparse retrievers [2506.04760].

## 3. Zero-Shot LLM-Based Query Expansion Protocol

Exp4Fuse employs a lightweight, zero-shot query expansion pipeline:

- The LLM (e.g., GPT4-mini), using a single-turn prompt with moderate temperature (0.6) and top-p (0.9), is queried to produce \(r_q\), capped at 128 tokens.
- To avoid query dilution by verbose LLM generations, the original query is repeated \(\lambda=5\) times and prepended to \(r_q\) for final expansion \(q_e\).
- Only a single LLM call is required per query, drastically reducing inference cost compared to few-shot or cascade prompting, and avoiding the need for multiple sparse or dense indices.

## 4. Implementation, Hyperparameters, and Efficiency

Exp4Fuse supports popular sparse retrievers: BM25, uniCOIL, SLIM, SPLADEv2, and their optimized “++” variants.

- **Pipeline:** The original query and LLM-generated expansion are submitted in parallel, each retrieving the top-1000 documents. Their rankings are then fused with the modified RRF.
- **Key parameters:** \(k=60\) (RRF), \(w_1 = w_2 = 1\), \(\lambda=5\), LLM temperature 0.6, top-p 0.9, max length 128 tokens.
- **Resource profile:** The framework requires only a single sparse index and one LLM call per query. The computational cost is roughly \(2\times\) a single sparse retrieval pass plus LLM generation. This is markedly lower than dense-sparse fusion, dense re-ranking, or multi-stage pipelines [2506.04760].

## 5. Experimental Benchmarks and Comparative Evaluation

Exp4Fuse was benchmarked on three MS MARCO-related in-domain datasets (MS MARCO dev, TREC DL 2019, TREC DL 2020) and seven BEIR out-of-domain collections (DBPedia, FiQA, TREC-NEWS, NQ, Robust04, Touche2020, SciFact).

- **Baselines included:** classic sparse (BM25, docT5query), learned sparse (uniCOIL, SLIM++, SPLADE++ v1/v2), LLM-augmented sparse (query2doc, LameR), dense (TAS-B, SimLM, Contriever+HyDE), and multi-stage models (monoT5, RepLLaMA+RankLLaMA, SPLADE+ColBERT).
- **Metrics:** MS MARCO (MRR@10, Recall@1000), TREC DL (MAP, nDCG@10), BEIR (nDCG@10).

| Dataset        | Baseline           | +Exp4Fuse Gain   | SOTA Achievement     |
|----------------|--------------------|------------------|----------------------|
| BM25 (MS MARCO)| MRR@10: baseline   | +2.3             |                      |
| docT5query     | nDCG@10: baseline  | +1–7             |                      |
| SPLADE++ v1    | nDCG@10: 73.1→77.6 | +4.5             | SOTA on TREC DL 2019 |
| BEIR (various) | nDCG@10:           | +4.3 to +8.5     |                     |

Exp4Fuse yields large and stable gains across all datasets and baselines, outperforming previous LLM-based expansion baselines (query2doc, LameR, HyDE) and, when paired with strong sparse retrievers, competitive or superior to state-of-the-art dense/multi-stage approaches [2506.04760].

## 6. Ablation Studies and Fusion Necessity

Analyses dissected the effect of multiple retrieval routes and the necessity of fusion:

- **Route count:** Adding more than two expansion routes (e.g., original, high-detail, medium, subtopic) yields diminishing returns; performance peaks at two (OQ+HDQ) before degrading due to low-precision noise from further expansion.
- **Fusion effect:** Using only the LLM-expanded query (HDQ) can degrade learned sparse retriever performance (e.g., SPLADE++ nDCG@10: 73.1→67.8), while the two-route fusion not only recovers but boosts performance substantially (73.1→77.6). Adding a third route yields only marginal gain (+0.1–0.7) [2506.04760].

## 7. Practical Considerations and Design Recommendations

Exp4Fuse is maximally effective in conjunction with high-performance learned sparse retrievers that index real documents. By maintaining both exact- and semantic-match signals through parallel original/expanded routes and fusion—rather than replacing the original query—Exp4Fuse prevents degradation of lexical matching.

Zero-shot LLM prompting minimizes engineering and computational overhead. The fusion design, with a single sparse index and lightweight LLM querying, renders Exp4Fuse suitable for large-scale, low-latency applications. The approach is robust to diverse information needs and supports rapid integration with strong domain-adapted sparse models.

## 8. Concluding Insights and Future Prospects

Exp4Fuse demonstrates that rank fusion of original and LLM-expanded queries, under a well-designed reciprocal rank fusion regime, can efficiently achieve SOTA sparse retrieval with minimal additional complexity. The architecture underscores a strong trade-off: semantic enrichment via LLM generation is absorbed without sacrificing exact-match signal or incurring the cost of dense retrieval pipelines.

A plausible implication is that Exp4Fuse's underlying principle—dual-route fusion with LLM-based zero-shot augmentation—can generalize beyond web-scale IR to domains where sparse retrievers and costly dense or re-ranking solutions are infeasible, as long as high-quality LLM expansions are available [2506.04760].

Source: https://www.emergentmind.com/topics/exp4fuse