On the Convergence Rate of MCTS for the Optimal Value Estimation in Markov Decision Processes

A recent theoretical analysis of a Monte-Carlo tree search (MCTS) method properly modified from the "upper confidence bound applied to trees" (UCT) algorithm established a surprising result, due to a great deal of empirical successes reported from heuristic usage of UCT with relevant adjus...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control Jg. 70; H. 7; S. 4788 - 4793
1. Verfasser:	Chang, Hyeong Soo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.07.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Approximation algorithms Artificial intelligence Complexity theory Computational modeling Convergence Data mining Estimation Markov decision process (MDP) Markov processes Monte-Carlo tree search (MCTS) multiarmed bandit (MAB) Search problems Training Uncertainty Upper bound upper confidence bound 1 (UCB1) upper confidence bound applied to trees (UCT)
ISSN:	0018-9286, 1558-2523
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!