Can QPP Choose the Right Query Variant? Evaluating Query Variant Selection for RAG Pipelines

TL;DR

This paper explores using Query Performance Prediction (QPP) to select optimal query variants in RAG pipelines, balancing retrieval relevance and generation quality efficiently.

Contribution

It introduces intra-topic discrimination for QPP in RAG, evaluating predictors for variant selection to improve end-to-end performance.

Findings

QPP can reliably identify better query variants for RAG.

Lightweight pre-retrieval predictors often match or outperform post-retrieval methods.

Variants optimizing ranking metrics may not yield the best generated answers.

Abstract

Large Language Models (LLMs) have made query reformulation ubiquitous in modern retrieval and Retrieval-Augmented Generation (RAG) pipelines, enabling the generation of multiple semantically equivalent query variants. However, executing the full pipeline for every reformulation is computationally expensive, motivating selective execution: can we identify the best query variant before incurring downstream retrieval and generation costs? We investigate Query Performance Prediction (QPP) as a mechanism for variant selection across ad-hoc retrieval and end-to-end RAG. Unlike traditional QPP, which estimates query difficulty across topics, we study intra-topic discrimination - selecting the optimal reformulation among competing variants of the same information need. Through large-scale experiments on TREC-RAG using both sparse and dense retrievers, we evaluate pre- and post-retrieval predictors under correlation- and decision-based metrics. Our results reveal a systematic divergence between retrieval and generation objectives: variants that maximize ranking metrics such as nDCG often fail to produce the best generated answers, exposing a "utility gap" between retrieval relevance and generation fidelity. Nevertheless, QPP can reliably identify variants that improve end-to-end quality over the original query. Notably, lightweight pre-retrieval predictors frequently match or outperform more expensive post-retrieval methods, offering a latency-efficient approach to robust RAG.