Abstract
Sutton and Barto’s criticism of evolutionary methods rests on the fact that such methods do not exploit the specific structure of the reinforcement learning problem. Instead, they just treat it like any other optimization problem, using total reward accrued as a fitness function. Much of this book focuses on eliminating this shortcoming by customizing such techniques to the unique characteristics of the reinforcement learning problem. As a result, the representation-learning power of methods like NEAT can be harnessed without sacrificing the advantages of other reinforcement learning approaches, such as temporal difference methods. The heart of this customization is presented in Chapter 4, which describes how to synthesize evolutionary and temporal difference methods so as to evolve representations for value functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Whiteson, S. (2010). On-Line Evolutionary Computation. In: Adaptive Representations for Reinforcement Learning. Studies in Computational Intelligence, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13932-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-13932-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13931-4
Online ISBN: 978-3-642-13932-1
eBook Packages: EngineeringEngineering (R0)