Metraipolis › archive › dc_296cb4ad334e

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control? — arXiv:2608.27985

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27985
License (as archived)
CC0-1.0
Archived
2026-10-17T11:06:30.392Z
SHA-256 of the archived text
7113036a8bac70d6ad2a76a7fc29fcf3a22487b0d9c785e2fc802181a80798eb
Stable URL of this page
https://metraipolis.com/documento/dc_296cb4ad334e

How to cite

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control? — arXiv:2608.27985 — arXiv (en), https://arxiv.org/abs/2608.27985 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_296cb4ad334e (Metraipolis archive dc_296cb4ad334e, sha256 7113036a8bac70d6ad2a76a7fc29fcf3a22487b0d9c785e2fc802181a80798eb)
BibTeX
@misc{dc296cb4ad334e,
  title = {Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control? — arXiv:2608.27985},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27985},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_296cb4ad334e; sha256 7113036a8bac70d6ad2a76a7fc29fcf3a22487b0d9c785e2fc802181a80798eb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27985. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Monte Carlo Tree Search (MCTS) and every-visit Monte Carlo (MC) control are usually presented as different methods. MCTS is described in the language of search (selection, expansion, simulation, and backup), whereas MC control is described in the language of reinforcement learning (trajectory sampling, return estimation, action-value updating, and policy improvement). This note argues that, at the level of trajectory generation and action-value updating, the distinction is largely terminological. The tree policy and rollout policy can be viewed as the learned and not-yet-learned parts of a single evolving policy; expansion corresponds to first visit and initialization; and backup is the ordinary every-visit Monte Carlo update. Under this interpretation, the four stages of MCTS reduce to two basic operations: trajectory sampling under the current policy and every-visit Monte Carlo updating. In this sense, MCTS is simply every-visit Monte Carlo control expressed in the language and data structure of search. The purpose of this note is expository: to make this equivalence explicit and easier to recognize.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-31 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.27985 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:50:25.789Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).