Continuous Upper Con dence Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Continuous Upper Con dence Trees


Upper Con dence Trees are a very e cient tool for solving Markov Decision Processes; originating in di cult games like the game of Go, it is in particular surprisingly e cient in high dimensional problems. It is known that it can be adapted to continuous domains in some cases (in particular continuous action spaces). We here present an extension of Upper Con dence Trees to continuous stochastic problems. We (i) show a deceptive problem on which the classical Upper Con dence Tree approach does not work, even with arbitrarily large computational power and with progressive widening (ii) propose an improvement, termed double-progressive widening, which takes care of the compromise between variance (we want in nitely many simulations for each action/state) and bias (we want su ciently many nodes to avoid a bias by the rst nodes) and which extends the classical progressive widening (iii) discuss its consistency and show experimentally that it performs well on the deceptive problem and on experimental benchmarks. We guess that the double-progressive widening trick can be used for other algorithms as well, as a general tool for ensuring a good bias/variance compromise in search algorithms.
Fichier principal
Vignette du fichier
c0mcts.pdf (174.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00745206 , version 1 (25-10-2012)


  • HAL Id : hal-00745206 , version 1


Adrien Couetoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, Nicolas Bonnard. Continuous Upper Con dence Trees. Learning and Intelligent Optimization: 5th International Conference, LION 5, Jan 2011, Rome, Italy. ⟨hal-00745206⟩
188 View
212 Download


Gmail Facebook Twitter LinkedIn More