- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes LfSearch, a dual-objective framework that jointly optimizes search behavior and the internalization of retrieved knowledge into model parameters. It adaptively activates retrieved-token learning based on rollout performance and uses non-negative advantages for retrieved content. Experiments cover two models and seven QA benchmarks, with additional evaluations without retrieval to assess knowledge retention.
Critical strengths
-
Learning from retrieved information while preserving search proficiency is a worthwhile research problem. The proposed training strategy avoids the performance degradation observed when retrieved-token masking is naively removed.
-
The evaluation includes knowledge-retention tests without retrieval, providing complementary evidence that the model retains information encountered during training.
Critical weaknesses
-
The improvements over the effective baseline are modest, and their reliability remains unclear. Based on the averages reported in Tables 1–2, LfSearch improves over standard Search-R1 by 1.39 and 1.63 percentage points on the two backbones. The 5.6-point improvement on Bamboogle is encouraging, but gains on several other benchmarks are small; for example, Qwen improves by only 0.04 points on TriviaQA and 0.15 points on HotpotQA. No repeated-run variance or confidence intervals are reported, making these smaller gains difficult to assess. Large improvements over the substantially degraded unmasked variant provide limited additional evidence of practical gains over standard Search-R1.
-
The paper insufficiently situates its contribution within broader developments in search agents, and the evaluation limits its applicability. Although the related work covers several retrieval and RL methods, it does not adequately discuss complex web information-seeking approaches such as WebDancer and WebSailor. The experimental RL baselines remain limited to Search-R1 and its unmasked variant. Moreover, experiments use a fixed Wikipedia corpus with at most five interaction steps per rollout, leaving effectiveness on sustained information-seeking tasks such as BrowseComp unestablished. A controlled benchmark such as BrowseComp-Plus could assess more demanding search while retaining a fixed corpus. Although the limitations section acknowledges the restricted setting, the current evidence does not establish the method’s relevance to more complex search-agent scenarios.
Questions for authors
-
Are the average improvements over standard Search-R1 consistent across training seeds? Could the authors provide repeated-run results or confidence intervals to clarify the reliability of the smaller gains?
-
Does LfSearch retain its advantage on BrowseComp or BrowseComp-Plus under matched backbones, retrieval tools, and interaction budgets? In particular, how do the activation frequency and effectiveness of the knowledge-learning branch change when tasks become harder and successful trajectories become rarer?