Multiple overlapping tiles for contextual Monte Carlo tree search

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

Volumn 6024 LNCS, Issue PART 1, 2010, Pages 201-210

  Rimmel, Arpad ^a   Teytaud, Fabien ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

MONTE-CARLO TREE SEARCHES; REWARD FUNCTION;

MONTE CARLO METHODS;

EID: 77952337886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12239-2_21     Document Type: Conference Paper

References (12)

1. 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)
2. Pearl, J.: Heuristics. Intelligent search strategies for computer problem solving. Addison-Wesley, Reading (1984)
3. Bertsekas, D.P.: Neuro-dynamic programming. In: Encyclopedia of Optimization, pp. 2555-2560 (2009)
4. De Mesmay, F., Rimmel, A., Voronenko, Y., Püschel, M.: Bandit-Based Optimization on Graphs with Application to Library Performance Tuning. In: International Conference on Machine Learning, Montŕeal Canada (2009)
5. Rolet, P., Sebag, M., Teytaud, O.: Optimal active learning through billiards and upper confidence trees in continous domains. In: Proceedings of the European Conference on Machine Learning (2009)
6. Chaslot, G., Fiter, C., Hoock, J.B., Rimmel, A., Teytaud, O.: Adding expert knowledge and exploration in Monte-Carlo Tree Search. In: Advances in Computer Games, Pamplona Espagne. Springer, Heidelberg (2009)
7. Sutton, R., Barto, A.: Reinforcement learning: An introduction. MIT Press, Cambridge (1998)
8. Sutton, R.S.: Learning to predict by the methods of temporal differences. Machine Learning, 9-44 (1988)
9. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2/3), 235-256 (2002)
10. Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6, 4-22 (1985)
11. Sherstov, E.A., Stone, P.: Function approximation via tile coding: Automating parameter choice. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol.3607, pp. 194-205. Springer, Heidelberg (2005)
12. Teytaud, F., Teytaud, O.: Creating an Upper-Confidence-Tree program for Havannah. In: Advances in Computer Games 12, Pamplona Espagne (2009)