- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1(−1)
Read review
Paper summary
The paper proposes AdaDR-RAG, an agentic RAG framework trained with reinforcement learning. It claims that existing agentic RAG methods retrieve a fixed number of documents per step regardless of information sufficiency, and that they optimize only final-answer correctness while ignoring the diversity and reliability of the search trajectories, and proposes two solutions. First, retrieval returns one chunk per search step and the agent can repeat the same query to page to the next cached chunk, with a reward that keeps the repeat ratio inside a tolerance band. Second, rollouts for a question are clustered by the semantic similarity of their query sequences, and each trajectory receives a diversity reward inversely proportional to its cluster size and a reliability reward equal to its cluster's mean answer correctness, added to the standard exact-match reward. The proposed method is evaluated on seven benchmarks with ten baselines.
Critical strengths
- The design of the reward shaping is reasonable for addressing the claims raised by the authors.
- The ablation study is comprehensive.
Critical weaknesses
- The motivating claim in line 60, "These studies failed to account for exploration diversity and factual reliability." is a strong claim about prior methods and is not supported anywhere in the paper. No baseline is measured for policy collapse or for behavior on ambiguous queries, and no benchmark of ambiguous questions is used. The only related evidence, Figure 3 and Table 3, compares AdaDR-RAG with and without its own reward terms, which still does not show that prior methods suffer from the stated failure. The claim should either be supported with measurements on the baselines or softened.
- The contribution of each component is shown only as aggregate deltas, with no qualitative analysis of how the component changes the model's behavior. There is no example of a trajectory that diversifies, no example of a query strategy that stabilizes, and no example of the paging mechanism retrieving evidence at depth that fixed-k misses. The two case studies in Appendix K compare the full model with Search-R1 and do not isolate any component.
- The baseline rows in Table 1 are reproduced digit-for-digit from other papers, and the evaluation protocols do not match. Those baseline rows match Search-P1's Table 1, which is labeled Accuracy, defined in that paper as whether the ground-truth string is contained in the response. All rows are presented under a single EM heading with no indication that any number is cited. The results are therefore not comparable.
Questions for authors
- What evidence supports the claim in line 60 that prior methods fail on exploration diversity and factual reliability? Can the authors show the attributed collapse on the existing methods under the same protocol?
- Can the authors give qualitative examples isolating each component: a strategy that appears only with , a strategy that stabilizes, and a question where paging reaches evidence that fixed-k misses?
- Which rows in Table 1 were run by the authors and which were cited? For the cited rows, what is the evaluation protocol? Are they measured with EM or with accuracy?
3 comments
Thank you for the re-scored results. However, Search-R1's paper states "Exact Match (EM) is used as the evaluation metric," and its evaluation script calls em_check, not subem_check. Could the authors point out where the Search-R1 codebase uses subem_check to compute the reported results? Otherwise the five rows taken from Search-R1 remain strict EM, and Table 1 still mixes two scoring rules.
I thank the authors for the response. However, my concerns for Q2 and Q3 are not addressed. For Q2, no qualitative examples were provided. For Q3, the function compute_score_subem cited in the response is not used anywhere in the Search-R1 codebase, and Search-P1's Search-R1 results are copied from Search-R1. Therefore, Table 1 still mixes two scoring rules.
I thank the authors for the responses. In Response 3, the clarification that the reported metric is reference-answer containment raises a new concern. The manuscript states "We use Exact Match (EM)," and the TreePS-RAG and Search-R1 numbers in Table 1 are strict exact match by those papers' definitions and released code, while the Search-P1 and HiPRAG numbers are containment. The table therefore mixes two scoring rules. Could the authors provide a version of Table 1 in which all rows are reported under a single metric? Otherwise the results are not comparable.