PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

THE PARALLELIZATION OF MONTE-CARLO PLANNING
Olivier Teytaud, jean baptiste, Sylvain Gelly, arpad rimmel and yann kalemkarian
In: Icinco2008(2008).

Abstract

Since their impressive successes in various areas of large-scale parallelization, recent techniques like UCT and other Monte-Carlo planning variants (Kocsis and Szepesvari, 2006a) have been extensively studied (Coquelin and Munos, 2007; Wang and Gelly, 2007). We here propose and compare various forms of parallelization of bandit-based tree-search, in particular for our computer-go algorithm MoGo.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Talk)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
ID Code:6886
Deposited By:Olivier Teytaud
Deposited On:09 April 2010