- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
SEQUIN improves intermediate search queries in agentic RAG while keeping the backbone frozen. A trajectory-aware rewriter produces alternative queries, and an intervention policy decides whether to keep or rewrite each query before retrieval. The rewriter is trained on beneficial rewrites identified through counterfactual rollouts. The policy is initialized from comparisons of intervention sequences and then optimized with ISPO. Across four multi-hop QA benchmarks, the paper reports gains for Search-R1 and HiPRAG, with additional results on Search-R1-7B. On Search-R1-3B, selective intervention also reduces rewrite calls relative to always rewriting.
Critical strengths
- The paper addresses a meaningful failure mode of query rewriting. Its experiments show that an untuned rewriter can hurt performance, whereas a trained rewriter and selective intervention improve final-answer accuracy. This supports the need to consider when an intermediate query should be left unchanged.
- The modular approach shows some portability across backbones. Positive results on both Search-R1 and HiPRAG suggest that the method is not tied to one agent implementation.
Critical weaknesses
- The practical motivation for a plug-and-play approach with a frozen backbone is not convincingly validated. The evaluated Search-R1 backbones are 3B and 7B, while inference adds a 3B query rewriter and a 0.5B intervention policy. Without results on a substantially larger or inaccessible backbone, or an end-to-end comparison with directly adapting a trainable backbone, it remains unclear when this more complex pipeline is preferable.
- The methodological novelty appears limited relative to prior work. Training a rewriter using feedback from a frozen reader was explored in [1]; learned query refinement in [2]; a plug-and-play retrieval policy around a frozen backbone in [3]; and selective use of rewriting in [4]. ISPO builds on the episode-level and step-level advantage framework of GiGPO [5], adapting it to intervention-action prefixes. The paper does not clearly establish a sufficiently distinct contribution beyond combining and adapting these existing ideas.
[1] Ma et al. “Query Rewriting in Retrieval-Augmented Large Language Models.” EMNLP, 2023. [2] Chan et al. “RQ-RAG: Learning to Refine Queries for Retrieval Augmented Generation.” COLM, 2024. [3] Fang et al. “SPARKLE: A Structured and Plug-and-play Agentic Retrieval Policy for Adaptive RAG Models.” ACL, 2026. [4] Shanian et al. “Better Together: Complementary Query Rewriting Under a Strong RAG Baseline.” EMNLP Industry Track, 2026. [5] Feng et al. “Group-in-Group Policy Optimization for LLM Agent Training.” NeurIPS, 2025.
Questions for authors
- For the trainable backbones used in the experiments, why train and deploy three separate language models rather than incorporate query rewriting and intervention into the backbone or a single auxiliary model? Could the authors compare their effectiveness and end-to-end costs, or validate the proposed motivation using a larger backbone that cannot be fine-tuned?
- Could the authors add a baseline without an intervention policy that retrieves with both the original and rewritten queries at every step, then deduplicates and merges the results? Please compare settings with the same final evidence budget as SEQUIN and with twice the evidence budget, and report answer quality and end-to-end costs.
2 comments
Response to Reviewer XcUx (Part 2/2)
2. Could the authors add a baseline without an intervention policy that retrieves with both the original and rewritten queries at every step, then deduplicates and merges the results? Please compare settings with the same final evidence budget as SEQUIN and with twice the evidence budget, and report answer quality and end-to-end costs.
We have added the dual-query retrieval baselines with matched and doubled evidence budgets, including their construction details, answer quality, and end-to-end runtime, to Appendix I and Table 8 of the revised manuscript.
(1) Baseline construction and answer quality.
We evaluated a baseline without an intervention policy that invokes the same trained query rewriter at every retrieval step and retrieves using both the original and rewritten queries. We interleave the two ranked lists, remove duplicate passages, and retain up to three unique passages (Merge-3) or six unique passages (Merge-6) per retrieval step. These settings match SEQUIN’s final evidence budget or double it, respectively. When fewer unique passages are available, we retain them without padding.
The following table reports EM percentages.
| Method | HotpotQA | 2WikiMultiHopQA | Bamboogle | MuSiQue | Macro-average |
|---|---|---|---|---|---|
| SEQUIN | 32.7 | 29.2 | 25.6 | 8.6 | 24.03 |
| Merge-3 | 31.7 | 29.8 | 20.8 | 7.5 | 22.45 |
| Merge-6 | 33.2 | 30.4 | 22.4 | 7.7 | 23.43 |
SEQUIN improves macro-average EM by 1.58 percentage points over Merge-3 and 0.60 percentage points over Merge-6, computed before rounding. Doubling the evidence budget improves the merging baseline, but its macro-average EM remains below SEQUIN. Merge-6 achieves higher EM on HotpotQA and 2WikiMultiHopQA, while SEQUIN performs better on Bamboogle and MuSiQue.
(2) End-to-end runtime, including the intervention policy’s cost.
We report total end-to-end evaluation time for each dataset in seconds, not single-question latency. Timing includes backbone inference, query rewriting, retrieval, and the applicable gating or merging operations. Model loading and warmup are excluded.
| Method | HotpotQA | 2WikiMultiHopQA | Bamboogle | MuSiQue |
|---|---|---|---|---|
| SEQUIN | 1451.07 | 1601.57 | 181.24 | 1598.41 |
| Merge-3 | 1597.38 | 1750.86 | 195.71 | 1840.58 |
| Merge-6 | 1762.81 | 2056.97 | 218.86 | 2112.46 |
Including SEQUIN’s gating cost, Merge-3 requires 8.0%–15.2% more evaluation time, and Merge-6 requires 20.8%–32.2% more time across the four benchmarks. In this setting, SEQUIN achieves higher macro-average EM and lower end-to-end runtime than both merging baselines while retaining a three-passage budget per retrieval step.
Response to Reviewer XcUx (Part 1/2)
Thank you for these comments and questions. We clarify SEQUIN’s methodological contributions relative to prior work and report additional dual-query retrieval comparisons below. All additional experiments use Search-R1-3B as the frozen backbone.
1. Methodological novelty and distinction from prior work.
We acknowledge the precedents identified by the reviewer. SEQUIN learns whether and how to modify intermediate queries already proposed by a frozen retrieval agent. Ma et al. [1] train a rewriter using frozen-reader feedback, including correctness-filtered supervision. SEQUIN evaluates rewrites at intermediate retrieval steps by preserving the trajectory prefix, substituting retrieved evidence, and continuing the agent to assess downstream outcomes. RQ-RAG [2] trains the model for query refinement and answer generation; SEQUIN keeps the existing agent’s parameters frozen. Its intervention policy chooses between retaining and rewriting an existing query, with retrieval performed in both cases. This differs from SPARKLE’s decisions about whether to retrieve, what query to generate, and which evidence to incorporate [3]. It also differs from the top-1 reranker-score threshold used to trigger query expansion and result merging in [4]: SEQUIN learns its intervention decisions from trajectory context and final-answer outcomes. ISPO explicitly builds on GiGPO’s episode- and step-level advantage framework [5], adapting it to keep/rewrite decisions through intervention-prefix grouping and combining it with forced-prefix exploration. Our contribution is a framework for selective rewriting of intermediate queries in Agentic RAG, with counterfactual supervision and policy optimization designed for this task.
[1] Ma et al. “Query Rewriting in Retrieval-Augmented Large Language Models.” EMNLP, 2023.
[2] Chan et al. “RQ-RAG: Learning to Refine Queries for Retrieval Augmented Generation.” COLM, 2024.
[3] Fang et al. “SPARKLE: A Structured and Plug-and-play Agentic Retrieval Policy for Adaptive RAG Models.” ACL, 2026.
[4] Shanian et al. “Better Together: Complementary Query Rewriting Under a Strong RAG Baseline.” EMNLP Industry Track, 2026.
[5] Feng et al. “Group-in-Group Policy Optimization for LLM Agent Training.” NeurIPS, 2025.