QUARK: Robust Retrieval under Non-Faithful Queries via Query-Anchored Aggregation
Not on the map. Why?
Abstract (arXiv)
User queries in real-world retrieval are often non-faithful (noisy, incomplete, or distorted), causing retrievers to fail when key semantics are missing. We formalize this as retrieval under recall noise, where the observed query is drawn from a noisy recall process of a latent target item. To address this, we propose QUARK, a simple yet effective training-free framework for robust retrieval under non-faithful queries. QUARK explicitly models query uncertainty through recovery hypotheses, i.e., multiple plausible interpretations of the latent intent given the observed query, and introduces query-anchored aggregation to combine their signals robustly. The original query serves as a semantic anchor, while recovery hypotheses provide controlled auxiliary evidence, preventing semantic drift and hypothesis hijacking. This design enables QUARK to improve recall and ranking quality without sacrificing robustness, even when some hypotheses are noisy or uninformative. Across controlled simulations and BEIR benchmarks (FIQA, SciFact, NFCorpus) with both sparse and dense retrievers, QUARK improves Recall, MRR, and nDCG over the base retriever. Ablations show QUARK is robust to the number of recovery hypotheses and that anchored aggregation outperforms unanchored max/mean/median pooling. These results demonstrate that modeling query uncertainty through recovery hypotheses, coupled with principled anchored aggregation, is essential for robust retrieval under non-faithful queries.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 28 Jan 2026.
Builds on
21 of 47 references.
References · 21
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 705
- 2020Making Monolingual Sentence Embeddings Multilingual using Knowledge Distillationcited by 591
- 2023Paraphrasing evades detectors of AI-generated text, but retrieval is an effective defensecited by 401
- 2023Large Language Models for Information Retrieval: A Surveycited by 331
- 2019Multi-Stage Document Ranking with BERTcited by 200
- 2019Asking Clarifying Questions in Open-Domain Information-Seeking Conversationscited by 136
- 2017Query expansion techniques for information retrieval: A surveycited by 44
9 more
- 2022Towards Robust Ranker for Text Retrievalcited by 37
- 2023Generative Query Reformulation for Effective Adhoc Searchcited by 24
- 2024Utilizing BERT for Information Retrieval: Survey, Applications, Resources, and Challengescited by 20
- 2024R-Bot: An LLM-based Query Rewrite Systemcited by 16
- 2018Phonetic-and-Semantic Embedding of Spoken Words with Applications in Spoken Content Retrievalcited by 11
- 2020Query Understanding via Intent Description Generationcited by 8
- 2023Perturbation-Invariant Adversarial Training for Neural Ranking Models: Improving the Effectiveness-Robustness Trade-Offcited by 7
- 2023Towards Effective Paraphrasing for Information Disguisecited by 5
- 2025Sparse and Dense Retrievers Learn Better Together: Joint Sparse-Dense Optimization for Text-Image Retrievalcited by 3
Built on by
Not cited yet.