菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-02-02
📄 Abstract - RE-TRAC: REcursive TRAjectory Compression for Deep Search Agents

LLM-based deep research agents are largely built on the ReAct framework. This linear design makes it difficult to revisit earlier states, branch into alternative search directions, or maintain global awareness under long contexts, often leading to local optima, redundant exploration, and inefficient search. We propose Re-TRAC, an agentic framework that performs cross-trajectory exploration by generating a structured state representation after each trajectory to summarize evidence, uncertainties, failures, and future plans, and conditioning subsequent trajectories on this state representation. This enables iterative reflection and globally informed planning, reframing research as a progressive process. Empirical results show that Re-TRAC consistently outperforms ReAct by 15-20% on BrowseComp with frontier LLMs. For smaller models, we introduce Re-TRAC-aware supervised fine-tuning, achieving state-of-the-art performance at comparable scales. Notably, Re-TRAC shows a monotonic reduction in tool calls and token usage across rounds, indicating progressively targeted exploration driven by cross-trajectory reflection rather than redundant search.

顶级标签: llm agents systems
详细标签: agent framework trajectory compression search efficiency reflection supervised fine-tuning 或 搜索:

RE-TRAC:面向深度搜索Agent的递归轨迹压缩框架 / RE-TRAC: REcursive TRAjectory Compression for Deep Search Agents


1️⃣ 一句话总结

这篇论文提出了一个名为Re-TRAC的新框架,它通过让AI在每次探索后总结关键信息并据此规划后续步骤,解决了现有AI搜索方法容易陷入局部最优和重复探索的问题,从而显著提升了搜索效率和准确性。

源自 arXiv: 2602.02486