Bandit algorithms for tree search

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 67-74

  Coquelin, Pierre Arnaud ^a   Munos, Rémi ^b  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS FUNCTIONS; GLOBAL OPTIMIZATION PROBLEMS; HIGH CONFIDENCE; HIGH PROBABILITY; TREE EXPANSION; TREE SEARCH; TREE-SEARCH METHODS; UPPER CONFIDENCE BOUND;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; GLOBAL OPTIMIZATION; OPTIMIZATION; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 70349275222     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. J.-Y. Audibert, R. Munos, and Cs. Szepesvári. Variance estimates and exploration function in multi-armed bandit. Research report 07-31, Certis - Ecole des Ponts, 2007.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning Journal, 47(2-3): 235-256, 2002. (Pubitemid 34126111)
3. P. Auer, R. Ortner, and Cs. Szepesvári. Improved rates for the stochastic continuum-armed bandit problem. Conference on Learning Theory, 2007.
4. P.-A. Coquelin and R. Munos. Bandit algorithms for tree search. Technical Report INRIA, RR-6141, 2007.
5. R. Coulom. Efficient selectivity and backup operators in Monte-Carlo tree search. 5th International Conference on Computer and Games, 2006.
6. S. Gelly, Y. Wang, R. Munos, and O. Teytaud. Modication of UCT with patterns in Monte-Carlo go. Technical Report INRIA RR-6062, 2006.
7. L. Györfi, L. Devroye, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, 1996.
8. L. Kocsis and Cs. Szepesvari. Bandit based monte-carlo planning. European Conference on Machine Learning, pages 282-293, 2006. (Pubitemid 44618839)