Papers › ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search

ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search

6 Jun 2024arXiv:2406.03816archive 2025-07-28

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.

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="2406.03816")

Code

Syntology Ran 9 of 22 code samples harvested from 2 repositories linked to this paper; 13 have no recorded run. Of those that ran: 1 ran · violated contract; 7 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 13 samples from 1 repository, 6 ran; community (archive-listed): 9 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

THUDM/ReST-MCTS officialmentioned in papermentioned on GitHubpytorch report
DIRECT-BIT/SRA-MCTS mentioned on GitHub 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

22 samples harvested; 9 ran; 0 honoured the contract we drafted; 13 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 · violated contract
7ran · our draft was wrong
1ran
13unverified

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; each sample names its own and says which. “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.

getBestChild THUDM/ReST-MCTS/MCTS/mcts.py official repository ran · our draft was wrong no licence file found · pointer only · fb7427c831c79168 · report
get_next_steps_roll THUDM/ReST-MCTS/MCTS/mcts.py official repository ran · our draft was wrong no licence file found · pointer only · 91b601baaf0d2b44 · report
gpt_usage thudm/rest-mcts/models/model.py official repository ran · our draft was wrong fingerprinted no licence file found · pointer only · 63ea91a630010b0e · report
isTerminal THUDM/ReST-MCTS/MCTS/mcts.py official repository ran · violated contract no licence file found · pointer only · 04c9e8ce083656fc · report
selectNode THUDM/ReST-MCTS/MCTS/mcts.py official repository ran · our draft was wrong no licence file found · pointer only · 88d52f64be6d8180 · report
treeNode THUDM/ReST-MCTS/MCTS/mcts.py official repository ran no licence file found · pointer only · ca2e487758bc8d8b · report
MCTS_search THUDM/ReST-MCTS/MCTS/mcts.py official repository unverified no licence file found · pointer only · 9c7f89c86df49382 · report
back_propagate THUDM/ReST-MCTS/MCTS/mcts.py official repository unverified no licence file found · pointer only · 15d94bcdfc2d9d1b · report
executeRound THUDM/ReST-MCTS/MCTS/mcts.py official repository unverified no licence file found · pointer only · 68319c1da6a20dbd · report
expand THUDM/ReST-MCTS/MCTS/mcts.py official repository unverified no licence file found · pointer only · 972b9f317f5321f0 · report
get_next_steps_expand THUDM/ReST-MCTS/MCTS/mcts.py official repository unverified no licence file found · pointer only · 4fd1ea2325d783a5 · report
greedyPolicy THUDM/ReST-MCTS/MCTS/mcts.py official repository unverified no licence file found · pointer only · 921b11d38034e3e8 · report
randomPolicy THUDM/ReST-MCTS/MCTS/mcts.py official repository unverified no licence file found · pointer only · f2cd3cffcc558e0c · report
getBestChild DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) ran · our draft was wrong Apache-2.0 (permissive) · a291959b6558d330 · report
get_next_steps_roll DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) ran · our draft was wrong Apache-2.0 (permissive) · d48bb511335b496a · report
selectNode DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) ran · our draft was wrong Apache-2.0 (permissive) · 3e9b96d2d986aaae · report
MCTS_search DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) unverified Apache-2.0 (permissive) · e819d89ad4828066 · report
executeRound DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) unverified Apache-2.0 (permissive) · 0f8338c98de6cd72 · report
expand DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) unverified Apache-2.0 (permissive) · 152f75c9b44ec04e · report
get_next_steps_expand DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) unverified Apache-2.0 (permissive) · a6cb18e8066512b4 · report
greedyPolicy DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) unverified Apache-2.0 (permissive) · 5eb7f8be714f63db · report
randomPolicy DIRECT-BIT/SRA-MCTS/MCTS/mcts.py community (archive-listed) unverified Apache-2.0 (permissive) · 735d77158ce66113 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

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