RSPSA: Enhanced parameter optimization in games

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

Volumn 4250 LNCS, Issue , 2006, Pages 39-56

  Kocsis, Levente ^a   Szepesvári, Csaba ^a   Winands, Mark H M ^b  

^a INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ANTITHETIC VARIABLES; AUTOMATIC OPTIMIZATION; COMMON RANDOM NUMBERS; EXPERIMENTAL STUDIES; FUNCTION PARAMETERS; PARAMETER OPTIMIZATION; RESEARCH DOMAINS; SIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION; SPEED-UPS; TWO DOMAINS;

APPROXIMATION THEORY; STRUCTURAL OPTIMIZATION; TUNING;

APPROXIMATION ALGORITHMS;

EID: 77049089986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11922155_4     Document Type: Conference Paper

References (18)

1. D. Billings, A. Davidson, T. Shauenberg, N. Burch, M. Bowling, R. Holte, J. Schaeffer, and D. Szafron. Game Tree Search with Adaptation in Stochastic Imperfect Information Games. In Proceedings of Computers and Games (CG'04), 2004.
2. Y. Björnsson and T. A. Marsland. Learning Extension Parameters in Game-Tree Search. Journal of Information Sciences, 154:95-118, 2003.
3. K. Chellapilla and D. B. Fogel. Evolving Neural Networks to Play Checkers Without Expert Knowledge. IEEE Transactions on Neural Networks, 10(6):1382-1391, 1999.
4. J. Dippon. Accelerated Randomized Stochastic Optimization. Annals of Statistics, 31(4):1260-1281, 2003.
5. C. Igel and M. Hüsken. Empirical Evaluation of the Improved Rprop Learning Algorithm. Neurocomputing, 50(C):105-123, 2003.
6. N. L. Kleinman, J. C. Spall, and D. Q. Neiman. Simulation-based Optimization with Stochastic Approximation using Common Random Numbers. Management Science, 45(11):1570-1578, Nov 1999.
7. L. Kocsis. Learning Search Decisions. PhD thesis, Universiteit Maastricht, Maastricht, The Netherlands, 2003.
8. L. Kocsis, H. J. van den Herik, and J. W. H. M. Uiterwijk. Two Learning Algorithms for Forward Pruning. ICGA Journal, 26(3):165-181, 2003.
9. P. L'Ecuyer and G. Yin. Budget-dependent Convergence Rate of Stochastic Approximation. SIAM J. on Optimization, 8(1):217-247, 1998.
10. D. Levy. Some Comments on Realization Probabilities and the Sex Algorithm. ICGA Journal, 25(3):167, 2002.
11. M. Riedmiller and H. Braun. A Direct Adaptive Method for Faster Backpropagation Learning: The RPROP Algorithm. In E.H. Ruspini, editor, Proceedings of the IEEE International Conference on Neural Networks, pages 586-591, 1993.
12. J. C. Spall. Multivariate Stochastic Approximation Using a Simultaneous Perturbation Gradient Approximation. IEEE Transactions on Automatic Control, 37:332-341, 1992.
13. J. C. Spall. Adaptive Stochastic Approximation by the Simultaneous Perturbation Method. IEEE Transactions on Automatic Control, 45:1839-1853, 2000.
14. G. Tesauro. Practical Issues in Temporal Difference Learning. Machine Learning, 8:257-277, 1992.
15. J. Theiler and J. Alper. On the Choice of Random Directions for Stochastic Approximation Algorithms. IEEE Transactions on Automatic Control, 51:476-481, 2006.
16. Y. Tsuruoka, D. Yokoyama, and T. Chikayama. Game-tree Search Algorithm based on Realization Probability. ICGA Journal, 25(3):132-144, 2002.
17. M. H. M. Winands. Informed Search in Complex Games. PhD thesis, Universiteit Maastricht, Maastricht, The Netherlands, 2004.
18. M. H. M. Winands, L. Kocsis, J. W. H. M. Uiterwijk, and H. J. van den Herik. Learning in Lines of Action. In Proceedings of BNAIC 2002, pages 99-103, 2002.