Papers › Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizing
Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizing
Ye Tian, Baolin Peng, Linfeng Song, Lifeng Jin, Dian Yu, Haitao Mi, Dong Yu
Despite the impressive capabilities of Large Language Models (LLMs) on various tasks, they still struggle with scenarios that involves complex reasoning and planning. Recent work proposed advanced prompting techniques and the necessity of fine-tuning with high-quality data to augment LLMs' reasoning abilities. However, these approaches are inherently constrained by data availability and quality. In light of this, self-correction and self-learning emerge as viable solutions, employing strategies that allow LLMs to refine their outputs and learn from self-assessed rewards. Yet, the efficacy of LLMs in self-refining its response, particularly in complex reasoning and planning task, remains dubious. In this paper, we introduce AlphaLLM for the self-improvements of LLMs, which integrates Monte Carlo Tree Search (MCTS) with LLMs to establish a self-improving loop, thereby enhancing the capabilities of LLMs without additional annotations. Drawing inspiration from the success of AlphaGo, AlphaLLM addresses the unique challenges of combining MCTS with LLM for self-improvement, including data scarcity, the vastness search spaces of language tasks, and the subjective nature of feedback in language tasks. AlphaLLM is comprised of prompt synthesis component, an efficient MCTS approach tailored for language tasks, and a trio of critic models for precise feedback. Our experimental results in mathematical reasoning tasks demonstrate that AlphaLLM significantly enhances the performance of LLMs without additional annotations, showing the potential for self-improvement in LLMs.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2404.12253")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2404.12253", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2404.12253")
Code
Syntology 18 code samples harvested from 1 repository linked to this paper: 14 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 9 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 9 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 18 samples from 1 repository, 14 ran (5 with no instrument failure; 9 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 14 samples that ran has no recorded date.
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
18 samples harvested: 14 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 9 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 18 of the 18 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 yetianjhu/alphallm. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.
ef6c4dacecbd6cb6 · report
fixture: returned MonteCarloTreeSearchNode · level recorded 2026-09-22 f75cff37d1f59a84 · report
fixture: signature text:str/0/str · returned str · level recorded 2026-09-24 b4a213ba708b085d · report
fixture: signature config:dict/0/?, suffix:str/0/str · returned str · level recorded 2026-09-24 72bf3605afc839b3 · report
fixture: signature input_string:str/0/str · returned str · level recorded 2026-09-24 29136163302afc0c · report
fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-24 2c7670bbc9fce517 · report
fixture: signature file:str/0/str · returned list · level recorded 2026-09-24 2fc084634834c538 · report
fixture: signature file:str/0/str · returned list · level recorded 2026-09-24 f1ff5a1574cecc9d · report
fixture: signature data:list/1/dict, n_samples:int/0/int, step_delimiter:str/0/str · returned list · level recorded 2026-09-24 bbbbf23c8b624b94 · report
fixture: signature text:str/0/str · returned str · level recorded 2026-09-24 48305b97411c62ac · report
fixture: signature text:str/0/str · returned str · level recorded 2026-09-24 3b7ff9f187ac8a13 · report
fixture: signature url:str/0/str · returned str · level recorded 2026-09-22 7c508037b40522af · report
fixture: signature v:str/0/str · returned bool · level recorded, date not recorded 387b9e6c4f21dd62 · report
fixture: signature batch:dict/0/?, device:str/0/str · returned dict · level recorded 2026-09-26 73b222be68d63972 · report
fixture: signature pred_answer_numbers:list/1/int, weights:list/1/float · returned int · level recorded 2026-09-22 d3ceda385feb848e · report
fe0186765fc4b2a7 · report
f4d93f19b3b4e1ac · report
e90b184086a6543b · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.
1 assembly on this paper: 1 harvested, 0 generated.
harvested Assembly for ALPHALLM (graph method: ALPHALLM). 5 bricks; individually on a fixture: 3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. The assembly has not been run end-to-end.
- MCTS entry · level 0 · unverified ·
d3ceda385feb848e - MonteCarloTreeSearchNode helper · level 1 · ran ·
ef6c4dacecbd6cb6 - weighted_vote helper · level 1 · ran · our draft was wrong ·
73b222be68d63972 - format_llama2 helper · level 0 · unverified ·
fe0186765fc4b2a7 - select_url helper · level 1 · ran · our draft was wrong ·
3b7ff9f187ac8a13
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2404.12253") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Arithmetic Reasoning | GSM8K | AlphaLLM (with MCTS) | Accuracy | 92 | #16 of 164 | Archive leaderboard | report |
| Arithmetic Reasoning | GSM8K | AlphaLLM (with MCTS) | Parameters (Billion) | 70 | #16 of 164 | Archive leaderboard | report |
| GSM8K | GSM8K | AlphaLLM (with MCTS) | Accuracy | 92 | #2 of 3 | Archive leaderboard | report |
| Math Word Problem Solving | MATH | AlphaLLM (with MCTS) | Accuracy | 51 | #45 of 135 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
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