Improving the exploration in Upper Confidence Trees

Adrien Couetoux (1) , Hassen Doghmen (2) , Olivier Teytaud (1, 2, 3)

1 LRI - Laboratoire de Recherche en Informatique
2 TAO - Machine Learning and Optimisation
3 Institut Montefiore - Department of Electrical Engineering and Computer Science

In the standard version of the UCT algorithm, in the case of a continuous set of decisions, the exploration of new decisions is done through blind search. This can lead to very inefficient exploration, par- ticularly in the case of large dimension problems, which often happens in energy management problems, for instance. In an attempt to use the information gathered through past simulations to better explore new de- cisions, we propose a method named Blind Value (BV). It only requires the access to a function that randomly draws feasible decisions. We also implement it and compare it to the original version of continuous UCT. Our results show that it gives a significant increase in convergence speed, in dimensions 12 and 80.

Domaines: Intelligence artificielle [cs.AI]

Adrien Couetoux, Hassen Doghmen, Olivier Teytaud. Improving the exploration in Upper Confidence Trees. Learning and Intelligent OptimizatioN Conference LION 6, Jan 2012, Paris, France. ⟨hal-00745208⟩