Yuyao Zhang, Guanting Dong, Yujia Zhou, Zhicheng Dou, Xiaoxi Li, Jiajie Jin, Yutao Zhu, Peitian Zhang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Large reasoning models (LRMs) like OpenAI-o1 have demonstrated impressive long stepwise reasoning capabilities through large-scale reinforcement learning. However, their extended reasoning processes often suffer from knowledge insufficiency, leading to frequent uncertainties and potential errors. To address this limitation, we introduce Search-o1, a framework that enhances LRMs with an agentic retrievalaugmented generation (RAG) mechanism and a Reason-in-Documents module for refining retrieved documents. Search-o1 integrates an agentic search workflow into the reasoning process, enabling dynamic retrieval of external knowledge when LRMs encounter uncertain knowledge points. Additionally, due to the verbose nature of retrieved documents, we design a separate Reason-in-Documents module to deeply analyze the retrieved information before injecting it into the reasoning chain, minimizing noise and preserving coherent reasoning flow. Extensive experiments on complex reasoning tasks in science, mathematics, and coding, as well as six open-domain QA benchmarks, demonstrate the strong performance of Search-o1. This approach enhances the trustworthiness of LRMs in complex reasoning tasks, paving the way for advanced deep research systems. The code is available at https: //github.com/RUC-NLPIR/Search-o1.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2501.05366")
get_code_for_paper("2501.05366")
have("2501.05366")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2501.05366.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2501.05366)
Connect an agent — have() is free.