atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Watch the Unobserved: A Simple Approach to Parallelizing Monte Carlo Tree Search

ICLR 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Monte Carlo tree search · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Track in-progress rollouts as unobserved samples and add their counts to the UCT exploration termparallel MCTS · Atari Gamesaverage episode return: 49%Helped
Track in-progress rollouts as unobserved samples and add their counts to the UCT exploration termparallel MCTS · Atari Gamesaverage episode return: 104%Helped
Track in-progress rollouts as unobserved samples and add their counts to the UCT exploration termparallel MCTS · Atari Gamesaverage episode return: 82%Helped
Increase the number of expansion and simulation workersWU-UCT · Joy City Level-35 and Level-58speedup: 15.5; 20.9Helped
Increase the number of parallel workersWU-UCT · Joy City Level-35 and Level-58average game steps: 0.67; 1.22No clear effect
Use WU-UCT for user pass-rate predictionJoy City pass-rate prediction system · 130 released game-levelsMAE: 8.6%Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy