Skip to content

Dense Expands, Sparse Anchors: Channel-Asymmetric Query Expansion for Hybrid Retrieval

Aug 2026 · 0 citations · 25 references
Computer Science

Abstract

LLM-based query expansion improves retrieval by generating document-like passages. In hybrid retrieval, however, most evaluations fuse fixed top-$L$ dense and sparse rankings. Because the cutoff controls both which cross-channel contributions enter fusion and how much of each ranking is accessed, gains measured at one $L$ can change or reverse at another. We separate these effects by evaluating retrieval effectiveness under complete-list fusion and recording the policy-specific per-channel replay stopping depths at which its ordered top-$K$ is certified. We then introduce DESA (Dense Expansion and Sparse Anchoring), a channel-asymmetric query expansion method. An LLM generates complementary reference passages; orthogonal residual expansion adds their new semantic directions to the dense query, while score-product anchoring incorporates their lexical cues into sparse retrieval without broadening the original query's lexical support. 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 access depths by 36.90% and 36.56%. With equal dataset weighting, 63.31% of queries become shallower in both channels. However, both depths increase with Contriever on Touch\'e-2020. These results support channel-specific integration of generated passages and joint evaluation of retrieval effectiveness and access depth.

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
Open access Jul 2026

ADAPTIVE MULTI-STAGE VECTOR RETRIEVAL FOR RETRIEVAL-AUGMENTED GENERATION

The Adaptive Multi-Stage Vector Retrieval (AMSVR) framework is proposed, prioritising weighted, drift-resistant composition over uniform fusion, and offers tailored configurations: AMSVR-Scientific (dense + tuned hybrid) peaks at NDCG@10 = 0.7570 on SciFact, while AMSVR-Full (seven stages) targets broader, noisier corp...

Samsudeen Alabi Bankole, Yakub Kayode Saheed · 0 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
Book Open access Jul 2026

Consensus-Anchored Expansion for Noise-Resilient Re-ranking

This work proposes AgreRank, a re-ranking method that leverages sparse-dense consensus for query expansion, and identifies anchor documents where both retrievers agree, expands the query through these verified anchors, and applies geometric gating to suppress drift from the original intent.

Nischal Subedi, Cencheng Shen · 0 citations
Jul 2026

Recall Before You Rank: Similarity-Guided Top-K Reuse for Efficient Long-Context Attention

ReTopK is a training-free method that accelerates dynamic Top-$K$ attention by reusing historical retrieval decisions and retains the complete KV cache and reuses only selected indices, rather than historical scores, attention weights, or outputs.

Wen-Shuai Yao, Wen-Yong Zhou, Hanyong Shao et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

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