arrow
返回

Universal parameter optimisation in games based on SPSA

delete2006-03-28
delete12
delete
OA
AI
L
Levente Kocsis
C
Csaba Szepesvári *
DOI:10.1007/s10994-006-6888-8delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use generic automatic parameter optimisation algorithms are known only for special problems such as the adjustment of the parameters of an evaluation function. The SPSA algorithm (Simultaneous Perturbation Stochastic Approximation) is a generic stochastic gradient method for optimising an objective function when an analytic expression of the gradient is not available, a frequent case in game programs. Further, SPSA in its canonical form is very easy to implement. As such, it is an attractive choice for parameter optimisation in game programs, both due to its generality and simplicity. The goal of this paper is twofold: (i) to introduce SPSA for the game programming community by putting it into a game-programming perspective, and (ii) to propose and discuss several methods that can be used to enhance the performance of SPSA. These methods include using common random numbers and antithetic variables, a combination of SPSA with RPROP, and the reuse of samples of previous performance evaluations. SPSA with the proposed enhancements was tested in some large-scale experiments on tuning the parameters of an opponent model, a policy and an evaluation function in our poker program, MCRAISE. Whilst SPSA with no enhancements failed to make progress using the allocated resources, SPSA with the enhancements proved to be competitive with other methods, including TD-learning; increasing the average payoff per game by as large as 0.19 times the size of the amount of the small bet. From the experimental study, we conclude that the use of an appropriately enhanced variant of SPSA for the optimisation of game program parameters is a viable approach, especially if no good alternative exist for the types of parameters considered.
Keyword:
SPSA
stochastic gradient ascent
games
learning
poker

期刊

Machine Learning 封面图
Machine Learning
IF:
2.9
论文数:
2.7K
被引数:
3.4W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
Observation of continuum radiations from the Cluster fleet: first results from direction finding
err2004-07-14
err0
errOAAI
errP. M. E. Décréau; C. Ducoin; G. Le Rouzic; O. Randriamboarison; J.-L. Rauch; J.-G. Trotignon; X. Vallières; P. Canu; F. Darrouzet; M. P. Gough; A. M. Buckley; T. D. Carozzi
err分享
err收藏
Learning to play chess using temporal differences
err2000-01-01
err84
errOAAI
errBaxter, J; Tridgell, A; Weaver, L
err分享
err收藏
Some unpleasant bargaining arithmetic?
err2017-09-01
err0
errOAAI
errHülya Eraslan; Antonio Merlo
err分享
err收藏
A bargaining model of endogenous procedures
err2016-11-21
err0
PREAI
errDaniel Diermeier; Carlo Prato; Razvan Vlaicu
err分享
err收藏
学者 查看更多内容