Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world problems, learning this value function requires a function approximator, which maps state-action pairs to values via a concise, parameterized function. In practice, the success of function approximators depends on the ability of the human designer to select an appropriate representation for the value function. A recently developed approach called evolutionary function approximation uses evolutionary computation to automate the search for effective representations. While this approach can substantially improve the performance of TD methods, it requires many sample episodes to do so. We present an enhancement to evolutionary function approximation that makes it much more sample-efficient by exploiting the off-policy nature of certain TD methods. Empirical results in a server job scheduling domain demonstrate that the enhanced method can learn better policies than evolution or TD methods alone and can do so in many fewer episodes than standard evolutionary function approximation.

PDF, PS, HTML

In {AAAI} 2006: {P}roceedings of the Twenty-First National Conference on Artificial Intelligence, 518-523, July 2006.

@InProceedings{whiteson:aaai06, title={Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning}, author={Shimon Whiteson and Peter Stone}, booktitle={{AAAI} 2006: {P}roceedings of the Twenty-First National Conference on Artificial Intelligence}, month={July}, pages={518-523}, url="http://nn.cs.utexas.edu/?whiteson:aaai06", year={2006} }