Papers › Iterative Self-Incentivization Empowers Large Language Models as Agentic Searchers

Iterative Self-Incentivization Empowers Large Language Models as Agentic Searchers

26 May 2025arXiv:2505.20128archive 2025-07-28

Zhengliang Shi, Lingyong Yan, Dawei Yin, Suzan Verberne, Maarten de Rijke, Zhaochun Ren

Large language models (LLMs) have been widely integrated into information retrieval to advance traditional techniques. However, effectively enabling LLMs to seek accurate knowledge in complex tasks remains a challenge due to the complexity of multi-hop queries as well as the irrelevant retrieved content. To address these limitations, we propose EXSEARCH, an agentic search framework, where the LLM learns to retrieve useful information as the reasoning unfolds through a self-incentivized process. At each step, the LLM decides what to retrieve (thinking), triggers an external retriever (search), and extracts fine-grained evidence (recording) to support next-step reasoning. To enable LLM with this capability, EXSEARCH adopts a Generalized Expectation-Maximization algorithm. In the E-step, the LLM generates multiple search trajectories and assigns an importance weight to each; the M-step trains the LLM on them with a re-weighted loss function. This creates a self-incentivized loop, where the LLM iteratively learns from its own generated data, progressively improving itself for search. We further theoretically analyze this training process, establishing convergence guarantees. Extensive experiments on four knowledge-intensive benchmarks show that EXSEARCH substantially outperforms baselines, e.g., +7.8% improvement on exact match score. Motivated by these promising results, we introduce EXSEARCH-Zoo, an extension that extends our method to broader scenarios, to facilitate future work.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2505.20128")

Code

Syntology Ran 1 of 13 code samples harvested from 1 repository linked to this paper; 12 have no recorded run. Of those that ran: 1 ran with no contract checked.

By repository: official repository: 13 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

mangopy/searchlm officialmentioned in paperpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 1 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran
12unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from mangopy/searchlm. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

remove_duplicate mangopy/searchlm/src/utilize/utilize.py official repository ran fingerprinted Apache-2.0 (permissive) · 765325bbb716f8dc · report
calculate_probability mangopy/searchlm/src/utilize/utilize.py official repository unverified Apache-2.0 (permissive) · 2d3b1c0d8ff65548 · report
causal_cross_entropy mangopy/searchlm/src/_entropy.py official repository unverified Apache-2.0 (permissive) · fac0d9d6ff56e2b2 · report
create_output_file mangopy/searchlm/src/inference.py official repository unverified Apache-2.0 (permissive) · 00512313aa5d3869 · report
document_retrieval mangopy/searchlm/src/utilize/apis.py official repository unverified Apache-2.0 (permissive) · de974ba295370e38 · report
eval_em mangopy/searchlm/src/utilize/metrics.py official repository unverified Apache-2.0 (permissive) · a100cdcea346bed3 · report
get_doc_by_ids mangopy/searchlm/src/instruction.py official repository unverified Apache-2.0 (permissive) · bbf687f13e8a8059 · report
get_from_openai mangopy/searchlm/src/utilize/apis.py official repository unverified Apache-2.0 (permissive) · 8c43f83df55cd40a · report
load_tokenizer mangopy/searchlm/src/_entropy.py official repository unverified Apache-2.0 (permissive) · a3518bfc816435e7 · report
normalize_answer mangopy/searchlm/src/utilize/metrics.py official repository unverified Apache-2.0 (permissive) · 93730b62e07a68f0 · report
rank_instruction mangopy/searchlm/src/instruction.py official repository unverified Apache-2.0 (permissive) · 13bc5dd5167e35d3 · report
rounder mangopy/searchlm/src/utilize/metrics.py official repository unverified Apache-2.0 (permissive) · 1ac4537f9c4bf017 · report
str_index_docs mangopy/searchlm/src/utilize/utilize.py official repository unverified Apache-2.0 (permissive) · 2988ca73371f5e72 · report

Tasks

Information Retrieval

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections