Evolving Neural Turing Machines for Reward-based Learning
Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
An unsolved problem in neuroevolution (NE) is to evolve artificial neural networks (ANN) that can store and use information to change their behavior online. While plastic neural networks have shown promise in this context, they have difficulties retaining information over longer periods of time and integrating new information without losing previously acquired skills. Here we build on recent work by Graves et al.  who extended the capabilities of an ANN by combining it with an external memory bank trained through gradient descent. In this paper, we introduce an evolvable version of their Neural Turing Machine (NTM) and show that such an approach greatly simplifies the neural model, generalizes better, and does not require accessing the entire memory content at each time-step. The Evolvable Neural Turing Machine (ENTM) is able to solve a simple copy tasks and for the first time, the continuous version of the double T-Maze, a complex reinforcement-like learning problem. In the T-Maze learning task the agent uses the memory bank to display adaptive behavior that normally requires a plastic ANN, thereby suggesting a complementary and effective mechanism for adaptive behavior in NE.
|Title of host publication||Proceedings of the Genetic and Evolutionary Computation Conference 2016|
|Number of pages||8|
|Place of Publication||New York, NY, USA|
|Publisher||Association for Computing Machinery|
|Publication status||Published - 2016|