- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes SearchTrimmer, a training-free method that evicts KV cache of search results while retaining other parts. It introduces a loop gate that limits repeated searches. Across agents and benchmarks, the method reduces KV usage while maintaining average accuracy and approximately preserving iteration counts.
Critical strengths
- The paper is well motivated by insightful findings. Specifically, it identifies search results as the major context bottleneck and hence target of optimization. It also finds that search results can be quickly absorbed into reasoning hence keeping reasoning while evicting older search results is useful.
- The observation that compaction leads to repetition is intersting. The paper also proposed loop gating to effectively address that. I think this will motivate some of the future work for model training and harness optimization.
- The method is evaluated end-to-end across agents and benchmarks, so the evaluation result is credible.
Critical weaknesses
The loop gate does not seem to be the best way to address it as it requires hyperparamters and is a bit heuristic-based. Could authors propose some learned way to address the search repetition problem?
Questions for authors
See weakness.
We thank the reviewer for the constructive suggestion. We agree that learning-based approaches could provide more adaptive control over search repetition. However, our goal is to develop a training-free framework that can be directly applied to existing deep research agents without retraining or introducing additional models. Loop Gating is therefore designed as a lightweight mechanism, motivated by our empirical observation that Loops account for most of the additional search calls induced by KV eviction (Figures 4 and 5). We also examine the accuracy–efficiency trade-off under different hyperparameter settings in Table 5 (Table 4 of the original manuscript).
Importantly, we believe the Restore/Loop distinction introduced in this work could provide useful supervision for future learning-based approaches. We envision two directions:
Loop-aware reward shaping: Penalizing Loops while leaving Restores unpenalized during reinforcement learning could encourage agents to avoid redundant searches directly.
Learned stopping policy: A lightweight classifier trained on agent trajectories could predict whether further exploration is likely to yield new evidence, enabling adaptive stopping decisions instead of relying on a fixed Loop budget.
These approaches could address complementary limitations of the current method. Reward shaping could reduce repetition at its source, while learned stopping could better distinguish productive exploration from unnecessary continuation. As shown in Appendix E.3 (Appendix D.2 of the original manuscript), our fixed-budget approach preserves most Restores but may still terminate trajectories before additional evidence is recovered. We consider learning-based extensions a promising direction for future work.