Skip to content
Preprint

Query Expansion Should Be Coordinated: Dense Expands, Sparse Anchors

Aug 2026 · 0 citations · 27 references
Computer Science

TL;DR

This work presents DESA (Dense Expansion and Sparse Anchoring), which shares generated references across channels but specializes their integration, which improves nDCG@10 and Recall@20 over the unexpanded query and reduces dense and sparse replay stopping depths.

Abstract

Retrieval-augmented generation (RAG) systems rely on retrieval modules to ground large language model (LLM) outputs. LLM-based query expansion enriches retrieval with document-like passages, but evaluations of hybrid retrieval often fuse fixed top-L prefixes of dense and sparse rankings. Because L controls cross-channel contributions and ranking access, it can alter measured expansion gains. We therefore evaluate complete-list effectiveness and record per-channel replay stopping depths required to certify the ordered top-K. This changes the design: because both rankings determine the fused result, their query constructions should be coordinated rather than designed independently. We present DESA (Dense Expansion and Sparse Anchoring), which shares generated references across channels but specializes their integration. Orthogonal residual expansion adds new semantic directions to the dense query, whereas score-product anchoring reorders the original sparse support without admitting expansion-only matches. The same references thus play complementary roles: Dense expands; Sparse anchors. Across seven BEIR datasets, DESA improves nDCG@10 and Recall@20 over the unexpanded query by 3.82% and 2.38%, while reducing dense and sparse replay stopping depths by 36.90% and 36.56%.

View source

Similar papers

#small language model Preprint Aug 2026

Query Expansion Is More Than Generation: Improving Dense Retrieval through Better Integration

This work introduces AnchorQE, a training-free method that separately encodes the original query and its expansion before interpolating them, and shows that AnchorQE improves retrieval effectiveness by up to 12.89% when compared to widely-used expansion-only or text-level concatenation baselines across TREC-DL, LoTTE,...

Sixia Sun, Mihai Surdeanu · 0 citations
Preprint Aug 2026

Exact Adaptive Hybrid Retrieval Without Fixed Top-L Cutoffs

This work proposes Exact Adaptive Hybrid Retrieval (EAHR), which fixes the ordered Top-$K$ defined by complete-list weighted RRF as the retrieval target and treats channel depth as request-specific execution state and reproduced the complete-list ordered Top-20 in all 150 query-snapshot combinations.

Chunran Zhang · 2 citations
Preprint Aug 2026

DEPT: Document Embedding Preservation Tuning for Unified Query Expansion and Retrieval

Document Embedding Preservation Tuning (DEPT) is introduced, which keeps tuned document embeddings close to cached initial embeddings while allowing retrieval gradients to pass through straight-through decoding into the generator.

Jingyuan Wang, Richong Zhang, Zhijie Nie et al. · 0 citations
Preprint Sep 2026

Tracing Query Expansion Effects through Sparse Autoencoder Features

Analysis shows that effective QE induces layer-concentrated changes in sparse latents aligned with retrieval intent and entity attributes, rather than only perturbing final query embeddings, and suggests that SAEs can explain QE effects and offer a lightweight option for precise retrieval behavior modulation without qu...

Fang Dong, Wei-Ran Shi, Zhi-Wei Xu et al. · 0 citations
Preprint Sep 2026

Top-K Is Not a Budget for Hybrid Retrieval

Modern hybrid retrieval for RAG typically fuses the Top-$L$ results from dense and sparse retrievers, but a fixed truncation depth may not transfer across changing queries and corpora. Exact fusion removes the dependence on a fixed depth, yet completing a specified Top-$K$ still incurs variable access costs. We present...

Chunran Zhang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.