Timezone: »

 
Poster
Variance Reduction in Monte-Carlo Tree Search
Joel Veness · Marc Lanctot · Michael Bowling

Tue Dec 13 08:45 AM -- 02:59 PM (PST) @
in Poster Session »

Monte-Carlo Tree Search (MCTS) has proven to be a powerful, generic planning technique for decision-making in single-agent and adversarial environments. The stochastic nature of the Monte-Carlo simulations introduces errors in the value estimates, both in terms of bias and variance. Whilst reducing bias (typically through the addition of domain knowledge) has been studied in the MCTS literature, comparatively little effort has focused on reducing variance. This is somewhat surprising, since variance reduction techniques are a well-studied area in classical statistics. In this paper, we examine the application of some standard techniques for variance reduction in MCTS, including common random numbers, antithetic variates and control variates. We demonstrate how these techniques can be applied to MCTS and explore their efficacy on three different stochastic, single-agent settings: Pig, Can't Stop and Dominion.

[ PDF] 

Author Information

Joel Veness (DeepMind)
Marc Lanctot (University of Alberta)
Michael Bowling (DeepMind / University of Alberta)

More from the Same Authors