Consistency modifications for automatically tuned Monte-Carlo tree search

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

Volumn 6073 LNCS, Issue , 2010, Pages 111-124

  Berthier, Vincent ^a   Doghmen, Hassen ^a   Teytaud, Olivier ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL POWER; HIGH-DIMENSIONAL; MONTE CARLO; OPTIMAL PERFORMANCE; PARAMETER-TUNING; REAL WORLD SITUATIONS; TREE SEARCH; TREE SEARCH ALGORITHM;

GENETIC PROGRAMMING; LEARNING ALGORITHMS; OPTIMIZATION; TUNING;

ASYMPTOTIC ANALYSIS;

EID: 77954594395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13800-3_9     Document Type: Conference Paper

References (16)

1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite time analysis of the multiarmed bandit problem. Machine Learning 47(2/3), 235-256 (2002) (Pubitemid 34126111)
2. Bellman, R.: Dynamic Programming. Princeton Univ. Press, Princeton (1957)
3. Chaslot, G., Hoock, J.-B., Teytaud, F., Teytaud, O.: On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers. In: ESANN, Bruges, Belgium (2009)
4. Chaslot, G., Saito, J.-T., Bouzy, B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-Carlo Strategies for Computer Go. In: Schobbens, P.-Y., Vanhoof, W., Schwanen, G. (eds.) Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 83-91 (2006)
5. 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)
6. 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)
7. De Mesmay, F., Rimmel, A., Voronenko, Y., Püschel, M.: Bandit-Based Optimization on Graphs with Application to Library Performance Tuning. In: ICML, Montréal, Canada (2009)
8. 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)
9. Kocsis, L., Szepesvari, 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)
10. Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6, 4-22 (1985)
11. 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)
12. 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)
13. Rolet, P., Sebag, M., Teytaud, O.: Optimal robust expensive optimization is tractable. In: Gecco 2009, Montréal Canada, 8 p. ACM, New York (2009); G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization, I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.8: Problem Solving, Control Methods, and Search
14. Teytaud, F., Teytaud, O.: Creating an Upper-Confidence-Tree program for Havannah. In: ACG 12, Pamplona, Espagne (2009)
15. Wang, Y., Audibert, J.-Y., Munos, R.: Algorithms for infinitely many-armed bandits. In: Advances in Neural Information Processing Systems, vol. 21 (2008)
16. 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)