Paper · 2026-11-11 · cs.CL, cs.AI
Faithful in Steps: Improving Generalization and Citation in RAG via Query Decomposition
QDRAG splits a multimodal question into subquestions (zero-shot QD-C, or QD-R trained with DPO on golden-context recall), reranks retrieved contexts per subquestion and splits a context budget by entropy. Author-reported, 14B: MMQA EM 53.1 vs 43.2 for Gemini-Pro; E-VQA Cite 40.4 vs 23.6.
Retrieval-augmented generationPassage rerankingTask decompositionPreference optimizationretrieval-augmented-generationquery-decompositionpassage-rerankingcitation-attributionmultimodal-qadirect-preference-optimization
AI-compiled by claude-haiku-5-5 on 2026-11-21, not yet reviewed by a human. Every claim cites its source; check it when a detail matters.
In plain words
A chatbot that answers from retrieved documents should also say which document each claim came from. With many documents and questions that need several hops (first find a person, then their film), the model often cites a document that looks similar but does not support the claim, or misses the one that does.
QDRAG first breaks the question into smaller questions, one per fact that has to be found. Each small question then decides which retrieved documents are relevant to it, and the model answers from that short, filtered list. The document budget is shared out by how unsure the scoring is for each small question: the less certain a question is, the more documents it keeps.
Two ways to break the question down are proposed. One uses the documents the first search returned to name the hidden entities. The other learns from retrieval results which breakdown finds the right documents most often. The second one is trained with a preference-learning objective, and the paper reports that this training carries over to other datasets better than training the answer step directly.
TL;DR
QDRAG is a retrieval-augmented generation pipeline with citations for multimodal multi-hop questions. A query decomposer produces subquestions, a reranker scores each retrieved context against each subquestion, an entropy-based allocator splits the context budget, and an MLLM writes the answer with citations. Author-reported results on MMQA, WebQA, InfoSeek and E-VQA are best with a 14B backbone, and QD fine-tuning generalises better than RAGQ fine-tuning in the authors' out-of-domain test. Hyperparameters and prompts that the paper defers to an appendix are not in the LaTeX source, and no code was found (see Paper vs code).
Problem
- Existing attributable RAG (RAGQ) systems are reported to degrade on multi-hop and multimodal questions in three ways: they cite contexts that match the local wording but not the whole question (over-citation); a plain search with the question text misses documents for entities the question refers to without naming (implicit entities); and instruction-tuned citation models generalise poorly to new data § Introduction.
- Sparse RAG (pre-filtering with a reranker) reduces distractors, but for multi-hop questions it discards contexts that hold only partial knowledge § Introduction. The authors report that this costs answer quality on multi-hop questions while helping single-hop ones § Methodology (Sparse Context Benefits RAG Quotes) fig. 4.
- Few-shot decomposition prompts depend on hand-written examples whose domain and difficulty may differ from the target questions § Introduction.
- Multi-hop questions can be split repeatedly, and a subquestion can depend on the answer to another one § Methodology (Multi-hop Question Answering).
Method
Overview: QDRAG has three modules, a query decomposer (QD), a context reranker and an answer generator. The decomposer derives subquestions, the reranker keeps the retrieved contexts relevant to each subquestion, and the MLLM then writes the answer and its citations token by token § Methodology (QDRAG Overview). Citations are in-line markers such as [1][2] that point to input contexts § Methodology (Preliminaries).
- Decomposition, QD-C (zero-shot, one MLLM call). Two operators run in a
single inference § Methodology (QD-C):
- Entity replacement: the MLLM marks referential expressions in the question, replaces each with an entity it names from its own knowledge (the text says "external knowledge"; the source is not further specified), and emits two subquestions per replacement. One asks whether the reference and the entity are the same. The other is the rewritten question.
- Open decomposition: the MLLM assigns the queried entities to subquestions so that each subquestion can be answered from a single context. For a which-came-first question about two entities, it produces one subquestion per entity's date § Methodology (Open Decomposition). The paper says QD-C needs no hand-written in-context examples.
- Decomposition, QD-R (multi-round retrieval). The input is only the question. The output is a plan of subquestions. A subquestion may refer to the answer of an earlier one through a placeholder token. The placeholders are resolved by running RAG on each earlier subquestion in turn, and each resolved subquestion then retrieves its own contexts for reranking § Methodology (QD-R) fig. 5.
- Training QD-R, QDARF. The paper trains QD-R with direct preference
optimisation (DPO) on pairs of decomposition plans § Methodology (QDARF):
- several plans per question are sampled from a teacher MLLM (Qwen2.5-VL-32B) and a student MLLM (Qwen2.5-VL-7B) § Methodology (QDARF);
- a plan's reward is how many golden contexts its subquestions recover § Methodology (QDARF);
- the highest-reward plan is the positive and the lowest-reward plan the negative § Methodology (QDARF) eq. 1;
- the reference model is the initial MLLM eq. 1. The paper describes the reward as retrieval feedback, in contrast to LLM judgments used by RAGQ training § Introduction tab. 5.
- Context reranking. Each retained context C is scored against each subquestion Q_i (and against the raw question) by the probability that the reranking prompt R returns "Yes" as the next token. The prompt is not reproduced in the source. Each subquestion keeps its top-ranked contexts § Methodology (Context Reranking).
- Adaptive budget allocation. Given a total budget N of contexts, the scores for each subquestion are turned into a softmax distribution over the context pool, and the entropy of that distribution is computed. Higher entropy means the scorer is less certain which context supports the subquestion, so that subquestion receives more of the budget. Subquestion i gets the share of N equal to its entropy divided by the sum of the entropies of all subquestions § Methodology (Adaptive Budget Allocator).
- Answer and citation generation. The MLLM receives the question and the kept contexts and generates the answer with citations § Methodology (Preliminaries). The prompts are not in the source.
Key equations:
\mathcal{L} = -\mathbb{E}_{(x,y_w,y_l)\sim\mathcal{D}} \left[ \log\sigma\left( \beta\log\frac{\pi_\theta(y_w\mid x)}{\pi_{\mathrm{ref}}(y_w\mid x)} - \beta\log\frac{\pi_\theta(y_l\mid x)}{\pi_{\mathrm{ref}}(y_l\mid x)} \right) \right] eq. 1
Here y_w and y_l are the winning and losing decomposition plans, pi_theta is the model being tuned and pi_ref the initial model eq. 1. The relevance score and the budget formulas are unnumbered displays in the source, so they are cited to their sections: § Methodology (Context Reranking) and § Methodology (Adaptive Budget Allocator).
# QDRAG answering [§ Methodology] (QDRAG Overview)
# Input: question, pool of retrieved contexts, budget N
# Output: answer text with citation ids
def answer_with_citations(question, pool, budget):
# 1. Split the question into subquestions [§ Methodology] (QD-C, QD-R)
subquestions = decompose(question) # list of strings
# 2. Score every context against every subquestion [§ Methodology]
# (Context Reranking)
relevance = {}
for sub in subquestions:
for ctx in pool:
relevance[sub, ctx] = p_yes(sub, ctx) # S(C|Q_i), in [0, 1]
# 3. Entropy of the softmax over each subquestion's scores [§ Methodology]
# (Adaptive Budget Allocator)
entropy = {}
for sub in subquestions:
weights = softmax([relevance[sub, c] for c in pool])
entropy[sub] = -sum(w * log(w) for w in weights)
# 4. Share the budget N in proportion to entropy [§ Methodology]
# (Adaptive Budget Allocator)
total = sum(entropy.values())
kept = set()
for sub in subquestions:
quota = budget * entropy[sub] / total # rounding not stated
top = sorted(pool, key=lambda c: -relevance[sub, c])[:quota]
kept.update(top) # union, see Pitfalls
# 5. Generate the answer and citations from the kept contexts
# [§ Methodology] (Preliminaries)
return mllm_generate(question, sorted(kept))# QDARF training pairs and loss [§ Methodology] (QDARF) [eq. 1]
# Input: questions, golden contexts per question, teacher and student MLLMs
# Output: DPO loss for the QD-R student
def build_pair(question, golden_contexts):
# 1. Sample several decomposition plans [§ Methodology] (QDARF)
plans = sample_plans(teacher, student, question)
for plan in plans:
# 2. Reward = recall of golden contexts over all subquestions
# [§ Methodology] (QDARF)
reward[plan] = golden_recall(plan, golden_contexts)
# 3. Highest-reward plan is positive, lowest is negative [§ Methodology]
# (QDARF)
y_w = argmax(reward)
y_l = argmin(reward)
return question, y_w, y_l
def dpo_loss(pairs, beta):
# 4. Widen the margin between positive and negative plans [eq. 1]
for (x, y_w, y_l) in pairs:
margin = beta * (log_ratio(y_w, x) - log_ratio(y_l, x))
return -mean(log_sigmoid(margin)) # log_ratio: policy vs referenceHyperparameters
| Name | Value | Where | Notes |
|---|---|---|---|
| Backbone, 7B systems | Qwen2.5-VL-7B | § Experiment (Implementation Details) | Used for QD, reranking and QA in single-size rows tab. 1 |
| Backbone, 14B systems | InternVL3-14B | § Experiment (Implementation Details) | Single-size rows use one MLLM for QD, reranking and QA tab. 1 caption |
| Reranker context count | top-5 | § Experiment (Implementation Details) | Stated as "reserve top-5 contexts"; relation to budget N not stated |
| Total budget N | not stated | § Methodology (Adaptive Budget Allocator) | No value in the text |
| Fine-tuning method | LoRA | § Experiment (Implementation Details) | Rank, alpha, target modules not stated |
| LoRA rank, alpha, learning rate, epochs, batch size, optimiser | not stated | — | Appendix referenced but absent from the LaTeX source |
| DPO beta | not stated | eq. 1 | Symbol appears, value not given |
| Teacher MLLM (QDARF) | Qwen2.5-VL-32B | § Methodology (QDARF) | |
| Student MLLM (QDARF) | Qwen2.5-VL-7B | § Methodology (QDARF) | Which model is tuned for the 14B row is not stated |
| Plans sampled per question | not stated | § Methodology (QDARF) | |
| DPO pairs per question | not stated | § Methodology (QDARF) | Text says "the highest" and "the lowest" plan |
| Sampling temperature | not stated | — | |
| Retriever, Table 1 | CLIP-ViT-L/14@336px | tab. 1 caption | Stated as the retriever for all models in Table 1 |
| Retriever, Table 2 | MMEmbed-7B | tab. 2 § Experiment (Main Results) | |
| Training data, QD-R | Training splits of MMQA and WebQA | § Experiment (Main Results) | Sizes not stated |
| Test size, MMQA | 1,196 queries | § Experiment (Datasets) | |
| Test size, WebQA | 4,967 queries | § Experiment (Datasets) | |
| Test size, InfoSeek, E-VQA | not stated | § Experiment (Datasets) | A commented-out sentence in the source gives other counts; not used |
| Judge model ψ | Qwen2.5-VL-32B | § Experiment (Evaluation Metrics) | Same symbol used for the LLM judge and for AutoAIS |
| Inference engine | vLLM v0.9.2 | § Experiment (Implementation Details) | |
| Hardware | 2 × A100 "80B" NVIDIA GPUs | § Experiment (Implementation Details) | Written as "80B" in source |
Results
Author-reported. Setup: four multimodal QA benchmarks; MMQA and WebQA are in-domain and InfoSeek and E-VQA are out-of-domain for the QD-R models trained on MMQA and WebQA § Experiment (Main Results). Metrics: EM (keyword match), LLM judge, and Cite, the AutoAIS support label for the cited contexts § Experiment (Evaluation Metrics). The source does not give units for Cite; the values are read as percentages. Full Table 1 follows; best and second-best marks from the source are omitted.
Full table tab. 1 (Model, Model Size; then MMQA EM/LLM/Cite, WebQA EM/LLM/Cite, InfoSeek EM/LLM/Cite, E-VQA EM/LLM/Cite; "-" means not reported):
| Model | Size | MMQA EM | MMQA LLM | MMQA Cite | WebQA EM | WebQA LLM | WebQA Cite | InfoSeek EM | InfoSeek LLM | InfoSeek Cite | E-VQA EM | E-VQA LLM | E-VQA Cite |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Gemini-Pro (dense) | - | 43.2 | 34.2 | 68.4 | 55.1 | 26.6 | 64.6 | 9.8 | 0.0 | 0.9 | 6.1 | 3.4 | 23.6 |
| Gemini-Pro (CLIP post-hoc) | - | - | - | 60.4 | - | - | 57.9 | - | - | 0.4 | - | - | 27.9 |
| Qwen2.5-VL (dense) | 7B | 42.4 | 40.6 | 38.2 | 57.8 | 41.5 | 33.0 | 42.5 | 36.7 | 59.6 | 10.4 | 7.8 | 18.5 |
| Qwen2.5-VL (CLIP post-hoc) | 7B | - | - | 47.2 | - | - | 35.5 | - | - | 58.4 | - | - | 26.5 |
| InternVL3 (dense) | 14B | 49.1 | 50.1 | 50.9 | 58.3 | 43.6 | 44.5 | 36.0 | 30.5 | 52.2 | 8.5 | 7.3 | 15.9 |
| InternVL3 (CLIP post-hoc) | 14B | - | - | 47.6 | - | - | 39.7 | - | - | 52.2 | - | - | 16.6 |
| CLIP reranker | 428M/7B | 35.0 | 32.4 | 39.5 | 50.9 | 22.9 | 36.8 | 40.7 | 32.4 | 56.0 | 9.2 | 6.5 | 16.1 |
| MMEmbed reranker | 7B | 43.6 | 41.2 | 51.4 | 55.9 | 36.7 | 44.7 | 41.8 | 35.6 | 60.9 | 9.5 | 6.9 | 22.0 |
| Sparse-RAG | 7B | 45.9 | 46.1 | 48.1 | 57.6 | 46.1 | 39.0 | 44.5 | 35.1 | 58.9 | 14.6 | 11.6 | 15.7 |
| RagVL | 13B/7B | 42.3 | 40.8 | 50.9 | 56.1 | 38.9 | 43.4 | - | - | - | - | - | - |
| LlamaIndex (QD, single round) | 7B | 43.3 | 42.1 | 50.0 | 56.4 | 40.8 | 44.1 | 10.4 | 2.1 | 3.2 | 13.1 | 10.7 | 20.0 |
| QDRAG-C | 7B | 43.3 | 42.2 | 52.6 | 56.7 | 40.2 | 45.8 | 42.2 | 35.4 | 62.1 | 9.6 | 7.5 | 21.2 |
| QDRAG-C | 14B | 46.8 | 46.9 | 55.8 | 57.4 | 39.7 | 48.6 | 36.9 | 28.7 | 56.5 | 6.5 | 5.5 | 15.3 |
| Self-Ask (QD, multi-round) | 7B | 42.9 | 41.9 | 49.9 | 56.2 | 40.1 | 43.8 | 42.7 | 34.5 | 60.6 | 9.7 | 8.4 | 21.1 |
| SearChain (QD, multi-round) | 7B | 43.7 | 42.6 | 49.3 | 56.3 | 40.6 | 45.1 | 42.4 | 34.3 | 64.0 | 10.0 | 8.0 | 21.7 |
| QDRAG-R, no DPO | 7B | 46.7 | 45.4 | 53.8 | 61.0 | 48.3 | 56.8 | 42.0 | 35.2 | 66.3 | 13.4 | 10.6 | 28.9 |
| QDRAG-R | 7B | 49.2 | 46.3 | 57.5 | 61.7 | 48.0 | 59.9 | 46.0 | 38.3 | 72.9 | 16.2 | 12.8 | 33.8 |
| QDRAG-R | 14B | 53.1 | 52.8 | 65.6 | 62.6 | 53.5 | 70.9 | 39.8 | 32.4 | 68.7 | 15.7 | 12.3 | 40.4 |
Headline comparison, QDRAG-R against the dense Gemini-Pro baseline tab. 1:
| Dataset | Metric | Gemini-Pro | QDRAG-R 7B | QDRAG-R 14B |
|---|---|---|---|---|
| MMQA (in-domain) | EM / LLM / Cite | 43.2 / 34.2 / 68.4 | 49.2 / 46.3 / 57.5 | 53.1 / 52.8 / 65.6 |
| WebQA (in-domain) | EM / LLM / Cite | 55.1 / 26.6 / 64.6 | 61.7 / 48.0 / 59.9 | 62.6 / 53.5 / 70.9 |
| InfoSeek (out-of-domain) | EM / LLM / Cite | 9.8 / 0.0 / 0.9 | 46.0 / 38.3 / 72.9 | 39.8 / 32.4 / 68.7 |
| E-VQA (out-of-domain) | EM / LLM / Cite | 6.1 / 3.4 / 23.6 | 16.2 / 12.8 / 33.8 | 15.7 / 12.3 / 40.4 |
On MMQA Cite, the 14B QDRAG-R (65.6) is below Gemini-Pro (68.4) tab. 1. The text says QDRAG-R-14B beats Gemini-2.5-Pro "in most cases" § Experiment (Main Results); the table names the model Gemini-Pro, so the two names are taken to be the same model.
Table 2, single-round RAGs with the 7B MMEmbed retriever tab. 2:
| Method | MMQA EM | MMQA LLM | MMQA Cite | WebQA EM | WebQA LLM | WebQA Cite |
|---|---|---|---|---|---|---|
| RAG | 67.7 | 64.1 | 51.3 | 70.7 | 64.0 | 60.9 |
| MMEmbed | 69.7 | 65.1 | 71.5 | 68.0 | 57.1 | 69.4 |
| SparseRAG | 67.9 | 66.1 | 71.9 | 68.5 | 60.9 | 65.3 |
| LlamaIndex | 68.0 | 65.7 | 69.9 | 69.6 | 61.2 | 72.1 |
| QDRAG-C | 70.7 | 66.4 | 74.7 | 70.7 | 63.7 | 75.1 |
The backbone of the RAG row is not named in the source.
Table 3, query decomposition against rewriting under the same pipelines tab. 3:
| Method | MMQA EM | MMQA LLM | MMQA Cite | WebQA EM | WebQA LLM | WebQA Cite |
|---|---|---|---|---|---|---|
| RaFe-C | 43.3 | 42.2 | 49.9 | 55.6 | 40.3 | 44.4 |
| QD-C | 43.3 | 42.2 | 52.6 | 56.7 | 40.2 | 45.8 |
| RaFe-R | 43.6 | 42.0 | 49.3 | 55.7 | 38.7 | 42.3 |
| RaFe-R + DPO | 43.8 | 42.7 | 50.2 | 57.4 | 41.7 | 48.4 |
| QD-R, no DPO | 46.7 | 45.4 | 53.8 | 61.0 | 48.3 | 56.8 |
| QD-R + DPO | 49.2 | 46.3 | 57.5 | 61.7 | 48.0 | 59.9 |
Table 4, out-of-domain test with fine-tuning task variants tab. 4. The "-" row for QDRAG-R equals the "no DPO" row of Table 1 on these four numbers tab. 1; the source does not say so.
| Pipeline | Fine-tuning task | InfoSeek LLM | InfoSeek Cite | E-VQA LLM | E-VQA Cite |
|---|---|---|---|---|---|
| RAG | - | 36.7 | 59.6 | 7.8 | 18.5 |
| RAG | RAGQ | 32.9 | 55.6 | 6.4 | 18.7 |
| RAG | QD-R | 36.6 | 62.3 | 7.8 | 19.1 |
| QDRAG-R | - | 35.2 | 66.3 | 10.6 | 28.9 |
| QDRAG-R | RAGQ | 33.0 | 68.4 | 8.6 | 26.0 |
| QDRAG-R | QD-R | 38.3 | 72.9 | 12.8 | 33.8 |
Table 5, feedback cost when building training data tab. 5:
| Fine-tuning task | Feedback | Automatic | Cost |
|---|---|---|---|
| RAGQ | LLM judge | yes | 28 h |
| QD-R | Retrieval | yes | 2 h |
Table 6, ablation on QDRAG-C. Columns D, R and S are checkmarks in the source; the text names R as replacement, D as decomposition and S as the adaptive context allocator tab. 6 § Experiment (Ablation Study):
| D | R | S | MMQA EM | MMQA LLM | MMQA Cite | WebQA EM | WebQA LLM | WebQA Cite |
|---|---|---|---|---|---|---|---|---|
| yes | yes | yes | 43.3 | 42.2 | 52.6 | 56.7 | 40.2 | 45.8 |
| yes | no | yes | 43.3 | 41.8 | 51.0 | 56.8 | 40.8 | 45.4 |
| no | yes | yes | 43.8 | 41.4 | 50.9 | 56.9 | 39.4 | 45.2 |
| yes | yes | no | 44.0 | 42.0 | 52.0 | 56.5 | 40.7 | 45.8 |
| no | no | no | 43.5 | 42.0 | 48.8 | 55.8 | 39.8 | 41.9 |
Table 7, ablation on QDRAG-R training data. Columns M and W are checkmarks in the source and are not defined in the text; S is the adaptive allocator tab. 7:
| M | W | S | MMQA EM | MMQA LLM | MMQA Cite | WebQA EM | WebQA LLM | WebQA Cite |
|---|---|---|---|---|---|---|---|---|
| yes | yes | yes | 49.2 | 46.3 | 57.5 | 61.7 | 48.0 | 59.9 |
| yes | no | yes | 46.9 | 44.6 | 56.9 | 61.1 | 48.1 | 56.9 |
| no | yes | yes | 46.4 | 45.4 | 54.3 | 61.6 | 48.3 | 58.3 |
| yes | yes | no | 48.8 | 46.0 | 56.5 | 61.9 | 47.8 | 60.6 |
| no | no | no | 46.9 | 45.0 | 54.8 | 61.0 | 48.1 | 56.9 |
Efficiency and cost. The per-query query-decomposition cost table fig. 8 (b), in dollars, uses n = average input tokens, m = average output tokens and r = number of MLLM calls, with cost = sum over calls of (n_r × p1 + m_r × p2), where p1 and p2 are Gemini-2.5-Pro input and output prices. Prices are not stated in the source.
| Method | Input tokens (n) | Output tokens (m) | Calls (r) | Cost (USD) |
|---|---|---|---|---|
| SearChain | 25715 | 391 | 10 | 0.070 |
| QDRAG-C | 4810 | 451 | 1 | 0.019 |
| QDRAG-R | 12660 | 237 | 4 | 0.035 |
The source also plots running time against the number of retrieved contexts per round fig. 8 (a); the text says the QDRAG variants produce more effective subquestions with less running time than the baselines § Experiment (Efficiency & Cost). No values are given in the text for that plot.
Figures are described in words only (see Pitfalls for the licensing note): fig. 1 shows the motivating failure modes of dense RAG, sparse RAG and QDRAG. fig. 2 contrasts fine-tuning on the RAGQ task with fine-tuning on the QD task. fig. 3 shows, on two image-retrieval datasets, that fewer distractor images give higher precision and higher recall in citation. fig. 4 compares dense and sparse RAG on single-hop and multi-hop questions: sparse RAG is ahead on single-hop questions and behind on multi-hop answer quality, while staying ahead on attribution. fig. 5 shows multi-plan sampling with recall as reward. fig. 6 splits failures into four cases by whether the input context and the citation are correct, and reports that most incorrect citations come from incorrect input contexts and that QD-R reduces failures. fig. 7 is a case study of decompositions judged by golden-context recall. fig. 9 visualises attention over image contexts when a dense RAG and QDRAG write a citation.
Paper vs code
No official code. The paper names no code repository. Its only URL is a footnote to the LlamaIndex project, which is a baseline, not the authors' code § Experiment (Baselines). Searches on GitHub's repository search for "qdrag", "QDRAG query decomposition", "faithful in steps rag" and "attributable rag query decomposition multimodal" found no repository owned by an author or by an author's organisation; the matches were unrelated projects. No author-linked organisation was identified.
Pitfalls
- Appendix missing from source. The paper defers hyperparameters and prompts to an appendix § Experiment (Implementation Details). The LaTeX source has no appendix. LoRA rank, learning rate, epochs, DPO beta, the budget N, the reranking prompt R, the decomposition prompts and sampling settings are not stated. Do not fill these from other papers.
- "Zero-shot" applies to prompting only. QD-C is zero-shot in the sense of no in-context examples. QD-R is zero-shot only at inference: it needs a training set, sampled plans, golden contexts for the reward, and DPO training § Methodology (QD-R, QDARF).
- Budget split is nearly even. The allocator applies a softmax to relevance probabilities, which lie in [0, 1]. Derived from the formula, not stated by the paper: exp(S) lies between 1 and e, so the softmax weights in one pool can differ by at most a factor of e, and each entropy lies within one nat of its maximum log K (K = pool size). The shares n(Q_i)/N therefore stay close to an even split across subquestions. The ablation nonetheless credits S with gains, yet several rows without S are equal or higher (Table 6 MMQA EM 44.0 vs 43.3; Table 7 WebQA Cite 60.6 vs 59.9), and no variance is reported. Check the split on real score distributions before relying on it.
- Entropy base cancels. The log base is not stated but cancels in the per-subquestion shares, so it does not matter.
- Merging per-subquestion lists is not stated. The pseudocode takes the union of the top lists, which the text does not say. Whether the raw question is also scored against the budget, and whether the budget is rounded to integers, are also not stated.
- Which model is tuned for 14B. The 14B backbone is InternVL3-14B, but QDARF samples from Qwen2.5-VL-32B (teacher) and Qwen2.5-VL-7B (student). The paper does not say which model is fine-tuned for the 14B row.
- Reward definition. The reward counts how many golden contexts a plan's subquestions recover, taken together. The source does not say how the subquestion results are combined into one recall, how ties are broken, or how many plans and pairs are used per question.
- Entity replacement knowledge source. The MLLM substitutes references using "external knowledge" § Methodology (Entity Replacement). The text does not say whether this is the model's own knowledge or a retrieval step.
- QD-R placeholders. Placeholders are filled by running RAG on earlier subquestions. The source does not say which reader or retriever produces these intermediate answers. Latency grows with the number of rounds (efficiency plot, fig. 8).
- Ablation labels. In Table 7, columns M and W are not defined. The text supports only that S is the allocator § Experiment (Ablation Study).
- Metric definitions. EM is the share of keywords from the gold answer that appear in the response, not a full string match § Experiment (Evaluation Metrics). The LLM judge is also called ψ, the symbol the text uses for Qwen2.5-VL-32B in the AutoAIS paragraph, but the judge is not named in its own sentence. Cite is the AutoAIS support label § Experiment (Evaluation Metrics); how labels are aggregated into one score is not stated.
- Retriever differs between tables. Table 1 uses CLIP-ViT-L/14@336px for all models tab. 1. Table 2 uses a 7B retriever, which the text names as MMEmbed-7B tab. 2 § Experiment (Main Results). The backbone of Table 2's RAG row is not named, and the table's RAG numbers differ from the dense Qwen row of Table 1, so the two are not interchangeable.
- Out-of-domain claim depends on the split. QD-R is trained only on the MMQA and WebQA training splits. InfoSeek and E-VQA always include an image in the query and use different knowledge bases § Experiment (Main Results). Training-set sizes are not stated, so the amount of training data behind the generalisation claim cannot be checked.
- Test sizes for InfoSeek and E-VQA are not stated in the text.
- Cost is a single price point. The cost table uses Gemini-2.5-Pro prices, which are not given, so the dollar figures cannot be recomputed from the paper.
- Hardware string. The source writes "A100 80B". The unit is probably 80 GB, but the source says "80B" and this card keeps the source spelling.
- Figures are not in this card. Figure content is described from the text and captions only, as the licensing rules require.
Lineage
- Builds on: RAG with quotes and citations, the RAGQ line, whose fine-tuning baseline is Front (Huang et al., 2024) § Introduction § Experiment (Baselines). Sparse RAG (Zhu et al., 2025) is the reranking baseline and the motivation for context sparsity § Introduction.
- Compared against: CLIP and MMEmbed rerankers, RagVL, Sparse-RAG, LlamaIndex, Self-Ask (Press et al., 2023), SearChain (Xu et al., 2024), and RaFe (Mao et al., 2024) for rewriting, adapted to reranking § Experiment (Baselines) tab. 1 tab. 3. Gemini-Pro and Qwen2.5-VL/InternVL3 are dense baselines tab. 1.
- Superseded by: not stated.
Source and license
Adapted from “Faithful in Steps: Improving Generalization and Citation in RAG via Query Decomposition” by Yue Liu, Zhongying Ru, Shimin Di, Jipeng Zhang, Ruiyuan Zhang, Xiaofang Zhou (arXiv:2611.15538), used under CC BY 4.0. Changes: condensed and restructured for implementation, with tables, equations and algorithms taken from the paper and its code, each cited to its source. Not affiliated with or endorsed by the authors.