Key points are not available for this paper at this time.
The idea of using evolutionary computation to train artificial neural networks, or neuroevolution (NE), for reinforcement learning (RL) tasks has now been around for over 20 years. However, as RL tasks become more challenging, the networks required become larger, as do their genomes. But, scaling NE to large nets (i.e. tens of thousands of weights) is infeasible using direct encodings that map genes one-to-one to network components. In this paper, we scale-up our compressed network encoding where network weight matrices are represented indirectly as a set of Fourier-type coefficients, to tasks that require very-large networks due to the high-dimensionality of their input space. The approach is demonstrated successfully on two reinforcement learning tasks in which the control networks receive visual input: (1) a vision-based version of the octopus control task requiring networks with over 3 thousand weights, and (2) a version of the TORCS driving game where networks with over 1 million weights are evolved to drive a car around a track using video images from the driver's perspective.
Building similarity graph...
Analyzing shared references across papers
Loading...
Jan Koutník
University of Applied Sciences and Arts of Southern Switzerland
Giuseppe Cuccu
University of Fribourg
Jürgen Schmidhuber
University of Applied Sciences and Arts of Southern Switzerland
University of Applied Sciences and Arts of Southern Switzerland
Building similarity graph...
Analyzing shared references across papers
Loading...
Koutník et al. (Sat,) studied this question.
synapsesocial.com/papers/6a104e4cd13714ec96ff9493 — DOI: https://doi.org/10.1145/2463372.2463509