loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: S. Ali Mirsoleimani 1 ; Aske Plaat 2 ; Jaap van den Herik 2 and Jos Vermaseren 3

Affiliations: 1 Leiden University Niels Bohrweg 1 and Nikhef Theory Group, Netherlands ; 2 Leiden University Niels Bohrweg 1, Netherlands ; 3 Nikhef Theory Group, Netherlands

Keyword(s): MCTS, Virtual Loss, Tree Parallelization, Search Overhead, Exploitation-exploration Trade-off.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Machine Learning ; Planning and Scheduling ; Simulation and Modeling ; Soft Computing ; Symbolic Systems

Abstract: Monte Carlo tree search algorithms, such as UCT, select the best-root-child as a result of an iterative search process consistent with path dependency. Recent work has provided parallel methods that make the search process faster. However, these methods violate the path-dependent nature of the sequential UCT process. Here, a more rapid search thus results in a higher search overhead. The cost thereof is a lower time efficiency. The concept of virtual loss is proposed to compensate for this cost. In this paper, we study the role of virtual loss. Therefore, we conduct an empirical analysis of two methods for lock-free tree parallelization, viz. one without virtual loss and one with the virtual loss. We use the UCT algorithm in the High Energy Physics domain. In particular, we methodologically evaluate the performance of the both methods for a broad set of configurations regarding search overhead and time efficiency. The results show that using virtual loss for lock-free tree paralleliz ation still degrades the performance of the algorithm. Contrary to what we aimed at. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.97.9.174

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Mirsoleimani, S. ; Plaat, A. ; van den Herik, J. and Vermaseren, J. (2017). An Analysis of Virtual Loss in Parallel MCTS. In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-220-2; ISSN 2184-433X, SciTePress, pages 648-652. DOI: 10.5220/0006205806480652

@conference{icaart17,
author={S. Ali Mirsoleimani and Aske Plaat and Jaap {van den Herik} and Jos Vermaseren},
title={An Analysis of Virtual Loss in Parallel MCTS},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2017},
pages={648-652},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006205806480652},
isbn={978-989-758-220-2},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - An Analysis of Virtual Loss in Parallel MCTS
SN - 978-989-758-220-2
IS - 2184-433X
AU - Mirsoleimani, S.
AU - Plaat, A.
AU - van den Herik, J.
AU - Vermaseren, J.
PY - 2017
SP - 648
EP - 652
DO - 10.5220/0006205806480652
PB - SciTePress