Microsoft's Re-TRAC framework enables AI agents to compress and share exploration trajectories across trials, avoiding repeated errors in deep search tasks. It outperforms ReAct on complex problems, with 4B model achieving SOTA and 30B surpassing 358B baselines. Open-source on GitHub for recursive trajectory compression.
Key Points
- 1.Recursive compression shares failure experiences across agent trajectories
- 2.4B model hits SOTA performance on deep search benchmarks
- 3.30B Re-TRAC beats 358B baselines by enabling progressive learning
- 4.Addresses ReAct's linear flaws in multi-round exploration
Impact Analysis
Boosts agent efficiency for real-world tasks, reducing compute waste – key for scalable AI deployment.
Technical Details
Builds on ReAct with trajectory compression to propagate insights, turning independent trials into cumulative learning.




