Skip to content
Preprint

Faithful Query Resolution for Conversational Search

Oct 2026 · 0 citations · 12 references
Computer Science

TL;DR

This paper compares five query-generation configurations within a behavior-adaptive assistant using BM25 and SPLADE retrieval, and finds that the weighted configuration obtains the highest mean retrieval scores, but this retrieval advantage does not coincide with the highest conversational satisfaction scores.

Abstract

Conversational query rewriting makes context-dependent requests explicit for retrieval, but additional context can introduce an information need the user did not express. This raises a question about the interaction between query fidelity and retrieval breadth. This paper examines that interaction in behavior-adaptive conversational search, using iKAT SCAI 2026 as the evaluation setting. We compare five query-generation configurations within a behavior-adaptive assistant using BM25 and SPLADE retrieval. A minimal-faithful resolver preserves the user's wording and resolves only context-dependent references; weighted reciprocal rank fusion combines its rankings with those from a learned rewriter and the raw utterance. Offline evaluation shows that adding these formulations recovers recall over the faithful query alone, with a slight reduction in nDCG@10. Across our five iKAT SCAI 2026 submissions, the weighted configuration obtains the highest mean retrieval scores, reaching nDCG@5 of 0.534, a 5.3\% relative improvement over the strongest alternative. However, this retrieval advantage does not coincide with the highest conversational satisfaction scores. These findings motivate separating faithful query interpretation from retrieval expansion, while assessing their effects on conversational utility independently.

View source

Similar papers

#artificial intelligence Open access Sep 2026

CompCQR: Compositional Query Generation for Training-Free Conversational Search

This work proposes a novel training-free method that generates a very large number of queries with minimal LLM usage by compositionally combining a small set of atomic components and applies LLM reasoning to construct a high-quality document set that balances precision and recall while capturing the user's core intent.

Yunah Jang, Kang-il Lee, Joongbo Shin et al. · 0 citations
Preprint Oct 2026

Learning Multi-Step Query Rewriting via Corpus Feedback for Conversational Search

Conversational Query Rewriting (CQR) turns a context dependent user turn into a standalone query for a retriever, and most methods do this in a single step from the dialogue history before retrieving once. The rewrite is therefore fixed before any corpus evidence is available to correct its reference resolution or its...

João Coelho, Hong Wang, Jie Yuan et al. · 0 citations
2026

RADAR: Retrieval-Aligned Attribution and Dual-Perspective Reasoning for Conversational Query Rewriting

RADAR is introduced, a novel feedback-driven framework that leverages the reasoning capabilities of Large Reasoning Models (LRMs) to generate and refine queries and introduces the Attribution-based Iterative Reasoning-Rewrite Refinement (AIR3) algorithm, which drives an iterative refinement process of pruning redundant...

Jia-Rui Lu, Tao Fang, Tian-Yu Zhang et al. · 0 citations
#natural language process... Preprint Oct 2026

Do Personalized LLMs Need the Whole Conversation? Matching the Full History with Only 5% of Its Text via Relevance-Filtered Context

Personalized assistants accumulate long conversation histories, and passing the whole history to an LLM with every request is costly. We show that it is also unnecessary. On PersonaMem-v2 (180 questions), with GPT-5.6-terra and Claude Opus 5.5 as judges, a relevance-filtered context, built by sentence-level retrieval t...

Eri Hayashi, Andrew Shin · 0 citations

UvA-DARE (Digital Academic Repository) Contextualizing and Expanding Conversational Queries without Supervision

A zero-shot unified resolution– retrieval approach that contextualizes and expands query embeddings using the conversation history and without fine-tuning on conversational data, and which can even outperform supervised methods in improving conversational retrieval.

A. Krasakis, A. Yates, andE.Kanoulas · 1 citation

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