Continuous upper confidence trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6683 LNCS, Issue , 2011, Pages 433-445

  Couëtoux, Adrien ^a,b   Hoock, Jean Baptiste ^a   Sokolovska, Nataliya ^a   Teytaud, Olivier ^a   Bonnard, Nicolas ^b  

^a INRIA   (France)

^b Artelys   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SPACES; COMPUTATIONAL POWER; CONTINUOUS DOMAIN; DECEPTIVE PROBLEM; GENERAL TOOLS; HIGH-DIMENSIONAL PROBLEMS; MARKOV DECISION PROCESSES; SEARCH ALGORITHMS; STOCHASTIC PROBLEMS;

ALGORITHMS; MARKOV PROCESSES; OPTIMIZATION;

FORESTRY;

ALGORITHMS; FORESTRY; OPTIMIZATION;

EID: 84868573385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25566-3_32     Document Type: Conference Paper

References (14)

1. Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. The Journal of Machine Learning Research 3, 397-422 (2003)
2. Chaslot, G., Winands, M., Uiterwijk, J., van den Herik, H., Bouzy, B.: Progressive Strategies for Monte-Carlo Tree Search. In: Wang, P., et al. (eds.) Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pp. 655-661. World Scientific Publishing Co. Pte. Ltd., Singapore (2007)
3. Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: Ciancarini, P., van den Herik, H.J. (eds.) Proceedings of the 5th International Conference on Computers and Games, Turin, Italy (2006)
4. Coulom, R.: Computing elo ratings of move patterns in the game of go. In: Computer Games Workshop, Amsterdam, The Netherlands (2007)
5. Finnsson, H., Björnsson, Y.: Simulation-based approach to general game playing. In: AAAI 2008: Proceedings of the 23rd National Conference on Artificial Intelligence, pp. 259-264. AAAI Press, Menlo Park (2008)
6. Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML 2007: Proceedings of the 24th International Conference on Machine Learning, pp. 273-280. ACM Press, New York (2007)
7. Kocsis, L., Szepesvári, C.: Bandit based monte-carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282-293. Springer, Heidelberg (2006)
8. Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6, 4-22 (1985)
9. Lee, C.-S., Wang, M.-H., Chaslot, G., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in Games (2009)
10. Nakhost, H., Müller, M.: Monte-carlo exploration for deterministic planning. In: Boutilier, C. (ed.) IJCAI, pp. 1766-1771 (2009)
11. Rolet, P., Sebag, M., Teytaud, O.: Optimal active learning through billiards and upper confidence trees in continous domains. In: Proceedings of the ECML Conference (2009)
12. Rolet, P., Sebag, M., Teytaud, O.: Optimal robust expensive optimization is tractable. In: Gecco 2009, p. 8. ACM, Montréal (2009)
13. Wang, Y., Audibert, J.-Y., Munos, R.: Algorithms for infinitely many-armed bandits. In: Advances in Neural Information Processing Systems, vol. 21 (2008)
14. Wang, Y., Gelly, S.: Modifications of UCT and sequence-like simulations for Monte-Carlo Go. In: IEEE Symposium on Computational Intelligence and Games, Honolulu, Hawaii, pp. 175-182 (2007)