Batch Monte Carlo Tree Search

2021-04-09 · Tristan Cazenave

Making inferences with a deep neural network on a batch of states is much faster with a GPU than making inferences on one state after another. We build on this property to propose Monte Carlo Tree Search algorithms using batched inferences. Instead of using either a search tree or a transposition table we propose to use both in the same algorithm. The transposition table contains the results of the inferences while the search tree contains the statistics of Monte Carlo Tree Search. We also propose to analyze multiple heuristics that improve the search: the $\mu$ FPU, the Virtual Mean, the Last Iteration and the Second Move heuristics. They are evaluated for the game of Go using a MobileNet neural network.

📄 PDF Abstract BibTeX arXiv:2104.04278

Code (0)

등록된 구현이 없습니다.

Tasks

Game of GoGPU

Accelerating Monte-Carlo Tree Search with Optimized Posterior Policies

2026-01-03 · Keith Frankston, Benjamin Howard arxiv

We introduce a recursive AlphaZero-style Monte--Carlo tree search algorithm, "RMCTS". The advantage of RMCTS over AlphaZero's MCTS-UCB is speed. In RMCTS, the search tree is explored in a breadth-first manner, so that ne…

Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms

2024-04-14 · Tristan Cazenave

Monte Carlo Tree Search and Monte Carlo Search have good results for many combinatorial problems. In this paper we propose to use Monte Carlo Search to design mathematical expressions that are used as exploration terms f…

Convolutional Monte Carlo Rollouts in Go

2015-12-10 · Peter H. Jin, Kurt Keutzer

In this work, we present a MCTS-based Go-playing program which uses convolutional networks in all parts. Our method performs MCTS in batches, explores the Monte Carlo search tree using Thompson sampling and a convolution…

GPU Thompson Sampling

Hedging of Financial Derivative Contracts via Monte Carlo Tree Search

2021-02-11 · Oleg Szehr

The construction of approximate replication strategies for pricing and hedging of derivative contracts in incomplete markets is a key problem of financial engineering. Recently Reinforcement Learning algorithms for hedgi…

Q-Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Learning Position Evaluation Functions Used in Monte Carlo Softmax Search

2019-01-30 · Harukazu Igarashi, Yuichi Morioka, Kazumasa Yamamoto

This paper makes two proposals for Monte Carlo Softmax Search, which is a recently proposed method that is classified as a selective search like the Monte Carlo Tree Search. The first proposal separately defines the node…

Position Reinforcement Learning