about
Query Decomposition for RAG (arxiv.org)
1 point by salkahfi 347 days ago | hide | past | pdf | discuss on HN

In plain words: Instead of splitting a question into subqueries and grabbing every document for each, this system pulls documents one at a time and decides whether to keep digging or switch subqueries. Scoring relevance with document rank plus human judgments raised document-level precision by 35%.

Abstract · Query Decomposition for RAG: Balancing Exploration-Exploitation

Retrieval-augmented generation (RAG) systems address complex user requests by decomposing them into subqueries, retrieving potentially relevant documents for each, and then aggregating them to generate an answer. Efficiently selecting informative documents requires balancing a key trade-off: (i) retrieving broadly enough to capture all the relevant material, and (ii) limiting retrieval to avoid excessive noise and computational cost. We formulate query decomposition and document retrieval in an exploitation-exploration setting, where retrieving one document at a time builds a belief about the utility of a given sub-query and informs the decision to continue exploiting or exploring an alternative. We experiment with a variety of bandit learning methods and demonstrate their effectiveness in dynamically selecting the most informative sub-queries. Our main finding is that estimating document relevance using rank information and human judgments yields a 35% gain in document-level precision, 15% increase in α-nDCG, and better performance on the downstream task of long-form generation.

Roxana Petcu, Kenton Murray, Daniel Khashabi, Evangelos Kanoulas, Maarten de Rijke, Dawn Lawrie, Kevin Duh
arXiv:2510.18633 · cs.AI · submitted Oct 21, 2025
abstract · pdf · html

add comment on HN