Papers › ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search
ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search
Dan Zhang, Sining Zhoubian, Ziniu Hu, Yisong Yue, Yuxiao Dong, Jie Tang
Recent methodologies in LLM self-training mostly rely on LLM generating responses and filtering those with correct output answers as training data. This approach often yields a low-quality fine-tuning training set (e.g., incorrect plans or intermediate reasoning). In this paper, we develop a reinforced self-training approach, called ReST-MCTS*, based on integrating process reward guidance with tree search MCTS* for collecting higher-quality reasoning traces as well as per-step value to train policy and reward models. ReST-MCTS* circumvents the per-step manual annotation typically used to train process rewards by tree-search-based reinforcement learning: Given oracle final correct answers, ReST-MCTS* is able to infer the correct process rewards by estimating the probability this step can help lead to the correct answer. These inferred rewards serve dual purposes: they act as value targets for further refining the process reward model and also facilitate the selection of high-quality traces for policy model self-training. We first show that the tree-search policy in ReST-MCTS* achieves higher accuracy compared with prior LLM reasoning baselines such as Best-of-N and Tree-of-Thought, within the same search budget. We then show that by using traces searched by this tree-search policy as training data, we can continuously enhance the three language models for multiple iterations, and outperform other self-training algorithms such as ReSTᴱᴹ and Self-Rewarding LM. We release all code at https://github.com/THUDM/ReST-MCTS.
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.
Syntology holds a reference implementation of ReST-MCTS * , generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='ReST-MCTS * ') (how to connect); the free check have('2406.03816') needs no token.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2406.03816")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2406.03816", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2406.03816")
Code
Syntology 22 code samples harvested from 2 repositories linked to this paper: 9 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 13 unverified. Where Syntology's instrument failed: 7 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 13 samples from 1 repository, 6 ran (2 with no instrument failure; 4 where Syntology's instrument failed); community (archive-listed): 9 samples from 1 repository, 3 ran (0 with no instrument failure; 3 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 on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 9 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
22 samples harvested: 9 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 13 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 13 of the 22 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 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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.
fb7427c831c79168 · report
fixture: signature node:MockMCTSNode/0/?, mcts_task:MockMCTSTask/0/? · returned MockMCTSNode · level recorded 2026-09-22 91b601baaf0d2b44 · report
fixture: signature y:str/0/str, step_n:int/0/int, mcts_task:MockMCTSTask/0/? · returned list · level recorded 2026-09-22 63ea91a630010b0e · report
fixture: signature backend:str/0/str · returned dict · level recorded, date not recorded 04c9e8ce083656fc · report
fixture: signature node:Node/0/?, mcts_task:MCTSTask/0/? · returned bool · level recorded 2026-09-22 88d52f64be6d8180 · report
fixture: signature node:MCTSNode/0/?, mcts_task:MCTSTask/0/? · returned tuple · level recorded 2026-09-22 ca2e487758bc8d8b · report
fixture: returned treeNode · level recorded 2026-09-22 9c7f89c86df49382 · report
15d94bcdfc2d9d1b · report
68319c1da6a20dbd · report
972b9f317f5321f0 · report
4fd1ea2325d783a5 · report
921b11d38034e3e8 · report
f2cd3cffcc558e0c · report
a291959b6558d330 · report
fixture: signature node:Node/0/?, mcts_task:MCTSTask/0/? · returned Node · level recorded 2026-09-22 d48bb511335b496a · report
fixture: signature y:str/0/str, step_n:int/0/int, mcts_task:MockMCTSTask/0/? · returned list · level recorded 2026-09-22 3e9b96d2d986aaae · report
fixture: signature node:MCTSNode/0/?, mcts_task:MCTSTask/0/? · returned tuple · level recorded 2026-09-22 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. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. 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. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.
3 assemblies on this paper: 2 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).
generated Assembly for ReST-MCTS * (graph method: ReST-MCTS * ), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 5 property tests passed on both).
label matches by construction: the code was generated for this method (not judged by a model)
- ucb_score entry · level 3 · ran · violated contract ·
8f2c25ead6164989b6a1fb97045365b936b7e908fba7632921e8fda7f9e52208
2 sibling assemblies for ReST-MCTS * (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.
harvested Assembly for ReST-MCTS * (graph method: ReST-MCTS * ). 12 bricks; individually on a fixture: 5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified. The assembly has not been run end-to-end.
one of 2 siblings
- MCTS_search entry · level 0 · unverified ·
9c7f89c86df49382 - executeRound helper · level 0 · unverified ·
68319c1da6a20dbd - treeNode helper · level 1 · ran ·
ca2e487758bc8d8b - back_propagate update_rule · level 0 · unverified ·
15d94bcdfc2d9d1b - expand sampler · level 0 · unverified ·
972b9f317f5321f0 - getBestChild helper · level 1 · ran · our draft was wrong ·
fb7427c831c79168 - greedyPolicy sampler · level 0 · unverified ·
921b11d38034e3e8 - randomPolicy sampler · level 0 · unverified ·
f2cd3cffcc558e0c - selectNode sampler · level 1 · ran · our draft was wrong ·
88d52f64be6d8180 - get_next_steps_expand helper · level 0 · unverified ·
4fd1ea2325d783a5 - get_next_steps_roll helper · level 1 · ran · our draft was wrong ·
91b601baaf0d2b44 - isTerminal helper · level 1 · ran · violated contract ·
04c9e8ce083656fc
harvested Assembly for ReST-MCTS * (graph method: ReST-MCTS * ). 12 bricks; individually on a fixture: 5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified. The assembly has not been run end-to-end.
one of 2 siblings
- MCTS_search entry · level 0 · unverified ·
e819d89ad4828066 - executeRound helper · level 0 · unverified ·
0f8338c98de6cd72 - treeNode helper · level 1 · ran ·
ca2e487758bc8d8b - back_propagate update_rule · level 0 · unverified ·
15d94bcdfc2d9d1b - expand sampler · level 0 · unverified ·
152f75c9b44ec04e - getBestChild helper · level 1 · ran · our draft was wrong ·
a291959b6558d330 - greedyPolicy sampler · level 0 · unverified ·
5eb7f8be714f63db - randomPolicy sampler · level 0 · unverified ·
735d77158ce66113 - selectNode sampler · level 1 · ran · our draft was wrong ·
3e9b96d2d986aaae - get_next_steps_expand helper · level 0 · unverified ·
a6cb18e8066512b4 - get_next_steps_roll helper · level 1 · ran · our draft was wrong ·
d48bb511335b496a - isTerminal helper · level 1 · ran · violated contract ·
04c9e8ce083656fc
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="2406.03816") returns these assemblies with each brick's role and wiring (how to connect).
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
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